BST Insert
Search for the value and hang a new leaf wherever the search runs out of tree.
Cost
- Best
- O(1)
- Average
- O(log n)
- Worst
- O(n)
- Space
- O(1)
Before this
Leads to
Topics that need this one first.
Taught by the same lesson
Binary Search Tree covers these too, in the same run.