SOLVE 3

Consider the binary search tree (BST) below, where each node has a label. Note that the label is NOT the key. The keys satisfy the BST property. Assume that the keys are distinct: Select all the statements below which are TRUE: Assuming all the keys are distinct, the minimum key is N3 and the maximum key is N8. The key of the node N9 is less than or equal to the keys of nodes N10 and N7. The height of the is 6. The successor of node N4 is N1. The predecessor of node N10 is N9. The list of nodes in the in order-tree-walk is N1, N2, N6, N3, N4, N7, N8, N5, N9, N10, N11, N12