Consider the binary search tree (BST) below, where each node has a label. Note t

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.

A: The height of the BST is 3.

B: N1 is the node with the maximum key.

C: The key of the node N6 is less than the key of the node N7

D: The successor of the node N4 is the node N2.

E: The predecessor of the node N1 is the node N8.

F: The list of nodes in the inorder-tree-walk is

N1, N4, N2, N7, N5, N8, N3, N6.

Explanation / Answer

Option A is true,the height of bst tree is 3

Option D is true

Option E is true

Option F is true

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.