Ethernet
August 31, 2024CMI 2019
| Question 3 |
Suppose that the figure to the right is a binary search tree. The letters indicate the names of the nodes, not the values that are stored. What is the predecessor node, in terms of value, of the root node A?
| D | |
| H | |
| I | |
| M |
Question 3 Explanation:
The predecessor of A is the rightmost node in the left subtree of A.
Correct Answer: C
Question 3 Explanation:
The predecessor of A is the rightmost node in the left subtree of A.
Subscribe
Login
0 Comments