Consider the binary search tree (BST) below, where each node has a label. Note t
ID: 3891542 • Letter: C
Question
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. 12 N14 N1 6 N11 N10 N13 N7 Select all the statements below which are TRUE: D The list of nodes in the preorder-tree-walk is Node Ni1 does not have a successor O The height of the BST is 5 G The height of the of the node N, is 1. N13 is the node with the maximum key O The predecessor of the node Ns is the node N12 G The key of the node Ns is larger than the key of the node N7Explanation / Answer
The first statement is incorrect preorder traversal
The second statement is correct as there is no right subtree
The third statement is true
The fourth statement is true as the max length of path is 5
The fifth statement is false as the height is 0
The sixth statement is false as the max element is N11
The sixth statement is true
The seventh statement is true