A Binary Search Tree is a node-based data structure where each node has at most two children. The left subtree contains values less than the node, and the right subtree contains values greater than the node.