A binary search tree (BST) in C is a binary tree where every node satisfies one invariant: all values in the left subtree are less than the node, and all values in the right subtree are greater. This ordering means search, insert, and delete all run in O(h) time — where h is the tree …