Binary Search Trees (BSTs)
What is a Binary Search Tree?
A Binary Search Tree (BST) is a data structure that maintains sorted order and allows for efficient searching, insertion, and deletion.
BSTs allow O(log n) search, insert, and delete operations in average cases.
Properties of a BST
- Each node has at most two children: left and right.
- The left subtree contains only nodes with values less than the parent.
- The right subtree contains only nodes with values greater than the parent.
Example Diagram
More Information
Learn more about BSTs here.