The main difference between a binary tree and a linked list is that
A) a linked list can be empty, but a binary tree cannot.
B) a binary tree can be empty, but a linked list cannot.
C) nodes in a binary tree have two successors instead of one.
D) recursion is useful on binary trees, but not on linked lists.
E) None of the above

Question

Quizplus · Accepted Answer

Nodes in a binary tree have two successors (left and right child nodes), whereas nodes in a linked list have only one successor (the next node in the list). This is the fundamental structural difference between the two data structures.

The Main Difference Between a Binary Tree and a Linked