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

Question $31$Answer

a$.$

A tree where each node has at most one child.

b$.$

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

c$.$

A tree where the root node has the largest value.

d$.$

A tree where each node has exactly two children.