Hide Index
Binary Search Tree
0% completed
Introduction to binary search trees
Height & balance in binary search trees
Recursive searching in binary search trees
Iterative searching in binary search trees
Insertion in binary search trees
Deletion in binary search trees
Constructing a binary search tree
Lowest common ansestor in binary search trees
Iterators in a binary search trees
Pattern: Sorted traversal
Pattern: Reversed sorted traversal
Pattern: Range postorder
Pattern: Two pointer
Certificate
Structure of a binary search tree
A binary search tree is a special type of binary tree that follows the binary search property.
For every node N in the binary search tree :
- All the values stored in the left subtree of `N` are less than the value stored in N
- All the values stored in the right subtree of N are greater than the value stored in N
Loading Image
Binary Search Property
Liking the course? Check our discounted plans to continue learning.