A program keeps track of a binary tree using a pointer to
A) one of its leaves.
B) its root node.
C) the node in the tree holding the biggest value.
D) the node in the tree holding the smallest value.
E) None of the above

Question

Quizplus · Accepted Answer

The best choice to keep track of a binary tree is to use a pointer to its root node. This is because the root node is the starting point of the tree, and from there all other nodes can be accessed. A pointer to any other node in the tree, such as a leaf node or a node holding the biggest or smallest value, would limit the program's ability to traverse the entire tree efficiently.

A Program Keeps Track of a Binary Tree Using a Pointer