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

Question

Quizplus · Accepted Answer

In a binary tree, each node can have up to two successors (children), whereas in a linked list, each node typically has only one successor (the next node).

The Main Difference Between a Binary Tree and a Linked