Binary Search Tree
A binary search tree keeps a promise at every node: smaller values live to the left, bigger values to the right. That one rule is what makes it fast to search.
step 01/22
- comparing
- target · placed
- on the path
A binary search tree keeps a promise at every node: smaller values live to the left, bigger values to the right. That one rule is what makes it fast to search.
step 01/22