A Binary Search Tree (BST) is a hierarchical data structure used for storing and organizing data efficiently. Each node in a BST contains a key value, a left child, and a right child. The tree is structured so that the left child of a node contains a smaller value, while the right child contains a larger value This property ensures that search, insertion, and deletion operations can be performed efficiently To search for a value, the algorithm starts at the root and moves left or right depending on whether the target value is smaller or larger than the current node's value.
