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 all the keys are distinct.

Select all the statement that are TRUE

1. N2 is the node with the maximum key

2. THe height of N9 is 4

3. They key of the node N3 is less than the key of henode N7

4. The successor of the node N11 is node N1

5. The predecessor of the node N10 is node N4

6. The list of nodes in the preorder-tree-walk is N11,N10,N8, N5, N4, N7, N9, N6, N3, N1, N2

7.The BST has 5 leaves

intr itro to Nio 7