Properties of Binary Search Trees:
- Each node has at most two children (left and right).
- All values in the left subtree are less than the node’s value.
- All values in the right subtree are greater than the node’s value.
- Search, insert, and delete take about O(log n) time when the tree is balanced.
Click
here
to learn more about Binary Search Trees