Binary Tree Search

Binary Tree: Inorder Search Logic

Searching in a Binary Tree (not necessarily a BST) requires visiting nodes. Using Inorder means we check the Left Child, then the Current Node, then the Right Child.

The Code

def inorder_search(node, target):
    # Base Case: Reach a leaf's child
    if node is None:
        return False

    # 1. Search Left
    if inorder_search(node.left, target):
        return True

    # 2. Check Current
    if node.val == target:
        return True

    # 3. Search Right
    return inorder_search(node.right, target)

Interactive Dry Run (Target: 4)

Click a row to see the state.