Python Binary tree search : <pre><code># stack_depth is initialised to 0
def find_in_tree(node, find_condition, stack_depth):
    assert (stack_depth &lt; max_stack_depth), 'Deeper than max depth'
    stack_depth += 1
    result = []
    if find_condition(node):
        result += [node]
    for child_node in node.children:
        result.extend(find_in_tree(child_node, find_condition, stack_depth))
    return result
</code></pre>

<p>I need help understanding this piece of code. The question i want to answer is </p>

<p><strong>The Python function above searches the contents of a balanced binary tree.
 If an upper limit of 1,000,000 nodes is assumed what should the max_stack_depth constant be set to?</strong></p>

<p>From what I understand, this is a trick question. If you think about it, stack_depth is incremented every time the find_in_tree() function is called in the recursion. And we are trying to find a particular node in the tree. And in our case we are accessing every single node every time even if we find the correct node. Because there is no return condition when stops the algorithm when the correct node is found. Hence, max_stack_depth should 1,000,000? </p>

<p>Can someone please try to explain me their thought process.</p>
