The Main Difference Between a Binary Tree and a Linked

question 13

Multiple Choice

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

---

Definitions:

Data Type

A classification identifying the type of data that can be held by a column in a database or a variable in programming, such as integer, text, or boolean.

Filter by Form

A method in database applications that allows users to specify criteria in a form-like interface to filter and display only matching records.

Query Design

The process of creating and structuring queries to extract or manipulate data from a database.

Number Fields

Fields in databases or forms designated to only contain numerical values.