BST Search
Compare with the node, go left if smaller, right if larger.
Binary Search Tree: Search for 45
45 is larger than 30: go right.
Cost
- Best
- O(1)
- Average
- O(log n)
- Worst
- O(n)
- Space
- O(1)
Before this
Related
Leads to
Topics that need this one first.
Taught by the same lesson
Binary Search Tree covers these too, in the same run.