Try this exercise. Fill in the missing part by typing it in.

In a binary search tree (BST), for any node, the values of its left sub-tree are ___ than the value of the node, and the values of its right sub-tree are ___ than the value of the node.

Solution: smaller, larger

Explanation: In a binary search tree (BST), the values of the nodes in the left sub-tree are smaller than the value of the node, and the values of the nodes in the right sub-tree are larger than the value of the node. This property of BSTs enables efficient searching, insertion, and deletion operations.