Binary Search Trees (BSTs) are a fundamental data structure used to store data in sorted order,
allowing efficient search, insertion, and deletion operations.
Key Features
Each node has at most two children.
All nodes in the left subtree have values less than the parent node.
All nodes in the right subtree have values greater than the parent node.
