Description

5 steps. Step 1 'BST Property': For every node: ALL values in left subtree < node < ALL values in right subtree. This ordering makes search efficient! In-order traversal gives SORTED output. Step 2 'Search O(log n)': def search(node, target): if not node: return None; if target < node.val: return se

Details