Question

Which of the following statements about binary search trees with no duplicate values is false?
a) The values in any left subtree are less than the values in its parent node.
b) The values in any right subtree are less than the values in its parent node.
c) The shape of the tree that corresponds to a particular set of data can vary based on the order in which the values are inserted into the tree.
d) It is possible that a binary tree could contain all its values along one straight path through the tree.

Answer

This answer is hidden. It contains 3 characters.