Every node in a binary tree can have pointers to
A) its left and right child.
B) its left and right parent.
C) binary nodes.
D) its end nodes.
E) None of the above

Question

Quizplus · Accepted Answer

In a binary tree, each node can have at most two children, one left child and one right child. Therefore, the best choice is A, which states that each node can have pointers to its left and right child. The other choices are not relevant to binary trees.

Every Node in a Binary Tree Can Have Pointers to