What is a Binary Search Tree $($BST$)?$

a$.$ A tree where each node has at most one child.

Ob$.$ A tree where the left child of a node has a smaller value, and the right child has a larger value.

OC A tree where the root node has the largest value.

Od$.$ A tree where each node has exactly two children.