Question 1

The in a binary tree is analogous to the head pointer in a linked list.

Accepted Answer

A) leaf pointer 
B) null pointer 
C) binary pointer 
D) root pointer 
E) None of the above 
A) leaf pointer 
B) null pointer 
C) binary pointer 
D) root pointer 
E) None of the above

Question 2

In certain types of binary trees, the number of leaves can be greater than the number of nodes.

Accepted Answer

A) True 
 B)False

Question 3

The shape of a binary search tree is

Accepted Answer

A) determined by the programmer. 
B) determined by the order in which values are inserted. 
C) always triangular. 
D) always balanced. 
E) None of the above 
A) determined by the programmer. 
B) determined by the order in which values are inserted. 
C) always triangular. 
D) always balanced. 
E) None of the above

Question 4

Binary tree are called "trees" because they resemble an upside- down tree.

Accepted Answer

A) True 
 B)False

Question 5

A subtree is the collection of some node, together with all its descendants.

Accepted Answer

A) True 
 B)False

Question 6

When a binary tree is used to facilitate a search, it is referred to as a

Accepted Answer

A) binary search tree. 
B) sort algorithm. 
C) binary queue. 
D) binary ordered deque. 
E) None of the above 
A) binary search tree. 
B) sort algorithm. 
C) binary queue. 
D) binary ordered deque. 
E) None of the above

Question 7

When an application begins searching a binary search tree, it starts at

Accepted Answer

A) the rightmost child of the root node. 
B) the root node. 
C) the middle node, halfway between the root and the longest branch. 
D) the outermost leaf node. 
E) None of the above 
A) the rightmost child of the root node. 
B) the root node. 
C) the middle node, halfway between the root and the longest branch. 
D) the outermost leaf node. 
E) None of the above

Question 8

Implementing a binary tree in a class requires a structure for representing the nodes of the binary tree, as well as a pointer to the structure as a class member. This pointer will be set to

Accepted Answer

A) the deepest leaf node. 
B) the leftmost child node. 
C) the first leaf node. 
D) the root of the tree. 
E) None of the above 
A) the deepest leaf node. 
B) the leftmost child node. 
C) the first leaf node. 
D) the root of the tree. 
E) None of the above

Question 9

One method of traversing a binary tree is

Accepted Answer

A) postorder traversal. 
B) preorder traversal. 
C) inorder traversal. 
D) All of the above 
E) None of the above 
A) postorder traversal. 
B) preorder traversal. 
C) inorder traversal. 
D) All of the above 
E) None of the above

Question 10

A binary tree node with no parent is called the

Accepted Answer

A) pointer node. 
B) binary node. 
C) root node. 
D) head pointer. 
E) None of the above 
A) pointer node. 
B) binary node. 
C) root node. 
D) head pointer. 
E) None of the above

Question 11

The height of a binary tree describes how many levels there are in the tree.

Accepted Answer

A) True 
 B)False

Question 12

The inorder method of traversing a binary tree involves traversing the left subtree, processing the data in the root, and then traversing the right subtree.

Accepted Answer

A) True 
 B)False

Question 13

Visiting all nodes of a binary tree in some methodical fashion is known as

Accepted Answer

A) climbing the tree. 
B) walking through tree. 
C) traversing the tree. 
D) branching out along the tree. 
E) None of the above 
A) climbing the tree. 
B) walking through tree. 
C) traversing the tree. 
D) branching out along the tree. 
E) None of the above

Question 14

A strong reason to use a binary search tree is

Accepted Answer

A) it is more flexible than the unary search tree. 
B) to enhance code readability. 
C) aesthetics and program design. 
D) to expedite the process of searching large sets of information. 
E) None of the above 
A) it is more flexible than the unary search tree. 
B) to enhance code readability. 
C) aesthetics and program design. 
D) to expedite the process of searching large sets of information. 
E) None of the above

Question 15

A child node that has no parent is

Accepted Answer

A) a leaf node. 
B) a rootless node. 
C) an orphan node. 
D) A or C 
E) None of the above 
A) a leaf node. 
B) a rootless node. 
C) an orphan node. 
D) A or C 
E) None of the above

Question 16

A program keeps track of a binary tree using a pointer to

Accepted Answer

A) its root node. 
B) the node in the tree holding the smallest value. 
C) one of its leaves. 
D) the node in the tree holding the biggest value. 
E) None of the above 
A) its root node. 
B) the node in the tree holding the smallest value. 
C) one of its leaves. 
D) the node in the tree holding the biggest value. 
E) None of the above

Question 17

Values are commonly stored in a binary search tree so that a node's _ child holds data that is less than the _ _ data, while the node's data is less than the data in the other child.

Accepted Answer

A) right, node's 
B) right, left child's 
C) left, node's 
D) left, right child's 
E) None of the above 
A) right, node's 
B) right, left child's 
C) left, node's 
D) left, right child's 
E) None of the above

The in a binary tree is analogous to the head pointer in a linked list.

In certain types of binary trees, the number of leaves can be greater than the number of nodes.

The shape of a binary search tree is

Binary tree are called "trees" because they resemble an upside- down tree.

A subtree is the collection of some node, together with all its descendants.

When a binary tree is used to facilitate a search, it is referred to as a

When an application begins searching a binary search tree, it starts at

Implementing a binary tree in a class requires a structure for representing the nodes of the binary tree, as well as a pointer to the structure as a class member. This pointer will be set to

One method of traversing a binary tree is

A binary tree node with no parent is called the

The height of a binary tree describes how many levels there are in the tree.

The inorder method of traversing a binary tree involves traversing the left subtree, processing the data in the root, and then traversing the right subtree.

Visiting all nodes of a binary tree in some methodical fashion is known as

A strong reason to use a binary search tree is

A child node that has no parent is

A program keeps track of a binary tree using a pointer to

Values are commonly stored in a binary search tree so that a node's _ child holds data that is less than the _ _ data, while the node's data is less than the data in the other child.

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

Searching, Sorting, and Algorithm Analysis

Pointers

More About Classes and Object-Oriented Programming

More on C-Strings and the String Class

Advanced File and Io Operations

Recursion

Polymorphism and Virtual Functions

Exceptions, Templates, and the Standard Template Library STL

Linked Lists

Stacks and Queues

Filters

Exam 19: Binary Trees

The in a binary tree is analogous to the head pointer in a linked list.

In certain types of binary trees, the number of leaves can be greater than the number of nodes.

The shape of a binary search tree is

Binary tree are called "trees" because they resemble an upside- down tree.

A subtree is the collection of some node, together with all its descendants.

When a binary tree is used to facilitate a search, it is referred to as a

When an application begins searching a binary search tree, it starts at

Implementing a binary tree in a class requires a structure for representing the nodes of the binary tree, as well as a pointer to the structure as a class member. This pointer will be set to

One method of traversing a binary tree is

A binary tree node with no parent is called the

The height of a binary tree describes how many levels there are in the tree.

The inorder method of traversing a binary tree involves traversing the left subtree, processing the data in the root, and then traversing the right subtree.

Visiting all nodes of a binary tree in some methodical fashion is known as

A strong reason to use a binary search tree is

A child node that has no parent is

A program keeps track of a binary tree using a pointer to

Values are commonly stored in a binary search tree so that a node's _ child holds data that is less than the _ _ data, while the node's data is less than the data in the other child.

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

Searching, Sorting, and Algorithm Analysis

Pointers

More About Classes and Object-Oriented Programming

More on C-Strings and the String Class

Advanced File and Io Operations

Recursion

Polymorphism and Virtual Functions

Exceptions, Templates, and the Standard Template Library STL

Linked Lists

Stacks and Queues

Filters