The ________ in a binary tree is analogous to the head pointer in a linked list.
A) root pointer
B) leaf pointer
C) null pointer
D) binary pointer
E) None of the above

Question

Quizplus · Accepted Answer

The root pointer in a binary tree points to the very first node or the root node, which is the starting point of the tree. Analogously, the head pointer in a linked list points to the very first node or the head node, which is the starting point of the linked list. Therefore, the root pointer in a binary tree is analogous to the head pointer in a linked list.

The ________ in a Binary Tree Is Analogous to the Head