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


C) nodes in a binary tree have two successors instead of one.

Computer Science & Information Technology

You might also like to view...

What ActionScript class can be used to load text or data into a file?

What will be an ideal response?

Computer Science & Information Technology

The criteria range of a database function must contain at least one column heading and one cell of information

Indicate whether the statement is true or false

Computer Science & Information Technology

An external assessment estimates the threat of network security attacks external to the organization. It determines how secure the external network and firewall are.

a. true b. false

Computer Science & Information Technology

A WebApp and its support environment have not been fully fortified against attack. Web engineers estimate that the likelihood of repelling an attack is only 30 percent. The system does not contain sensitive or controversial information, so the threat probability is 25 percent. What is the integrity of the WebApp?

What will be an ideal response?

Computer Science & Information Technology