A Binary Search Tree (BST) is a hierarchical node-based data structure where each node satisfies the binary search invariant: all keys residing in a node's left subtree are strictly smaller than the node's key, and all keys in the right subtree are strictly greater. This structural ordering allows binary search algorithms to execute lookups, insertions, and deletions in O(log n) average time complexity by halving the remaining search space at each branch comparison.