BST Search
← Back to Binary Search Trees
Compare target with current node; go left if smaller, right if larger. Eliminates half the remaining nodes at each step. O(log n) average, O(n) worst case if unbalanced.
← Back to Binary Search Trees
Compare target with current node; go left if smaller, right if larger. Eliminates half the remaining nodes at each step. O(log n) average, O(n) worst case if unbalanced.