Binary Search Tree - BST
Learn Binary Search Tree - BST (Trees, Data Structures & Algorithms) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.
The BST Ordering Property For EVERY node in a Binary Search Tree: everything in its left subtree is SMALLER, everything in its right subtree is LARGER. This ordering is what makes search, insert, and delete all O(h) - O(log n) on a balanced tree, since each comparison eliminates one whole subtree.
More lessons in Trees
- Binary Tree
- Full / Complete / Perfect Binary Tree
- Balanced Tree
- Tree Traversal - Preorder
- Tree Traversal - Inorder
- Tree Traversal - Postorder
- Tree Traversal - Level Order
- Recursive Traversal
- Iterative Traversal
- Height / Depth
- Diameter of a Tree
- Lowest Common Ancestor
- Path Sum
- Tree View - Left View
- Tree View - Right View
- Tree View - Top View
- Tree View - Bottom View
- Boundary Traversal
- Vertical Traversal
- Zigzag Traversal
- Serialize / Deserialize a Tree
- BST Operations
- BST Validation
- Kth Smallest / Largest in BST
- Morris Traversal