For binary search trees with no duplicate entries, entries in the right subtree of a node are less than the entry in the node.
There are no hints for this question