What is a Binary Search Tree (BST) and what property does it maintain?

A Binary Search Tree is a binary tree where for each node, all values in its left subtree are smaller and all values in its right subtree are larger (BST property). This ordering enables efficient searching, insertion, and deletion with O(log n) average time complexity. An in-order traversal of a BST yields elements in sorted order, making it useful for maintaining sorted data dynamically.