A Binary Search Tree is a data structure where each node has at most two children, and the left child is less than the parent, while the right child is greater than the parent.