Binary Search Tree
binary sorted tree
A binary search tree (BST) is a tree data structure where each node has at most two children (left and right subtrees), and the value of each node is greater than all values in its left subtree and less than all values in its right subtree. This property allows for efficient searching, insertion, and deletion operations – typically with logarithmic time complexity.