Skip to main content

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