A Binary Search Tree (BST) is a data structure in which each node has at most two children, referred to as the left child and the right child. For every node, all values in the left subtree are less than the node's value, and all values in the right subtree are greater.
