Suppose a Binary Tree Is Implemented as a Linked Structure

question 21

Multiple Choice

Suppose a binary tree is implemented as a linked structure in which each node contains both a left child pointer and a right child pointer. Which of the following statements is false?

• A) The number of nodes in the tree is always at least the number of nodes on the longest path in the tree.
• B) The number of NIL pointers in the tree is always greater than the number of nodes in the tree.
• C) Each terminal node in the tree is always at the end of a path that is as least as long as any other path in the tree.
• D) Both the left child and right child pointers of every terminal node are NIL.

---

Definitions:

Rating Field

A data field in a form or database used to capture evaluations or assessments usually based on a numerical scale.

Background Image

An image set to appear behind the content in a user interface element or web page.

Other Controls

Refer to additional elements or widgets in software applications that allow users to interact with the application, beyond standard input fields.

Record Source

The source from which data is retrieved for display or processing in a database or application component.