Question: The main difference between a binary tree and a linked list is that a . a linked list can be empty, but a binary tree
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 these
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
