This post is a continuation of my interesting CS interview questions series. The last two problems discussed in this post lean more towards logic and probability rather than a CS concept.
Consider the Lock and Unlock operation defined on an m-ary tree as follows:
Lock Node X => If (no node present in the subtree rooted at [...]
Filed under: Coding, Computer Science, Problem | Tagged: algorithms, binary tree, C program, Complexity, data structures, functions, interviews, linked lists, logic, Probability, recursion, SDT, software development engineer, Space complexity, stack, Time complexity | Leave a Comment »
