Question 1

Deleting a leaf node from a binary tree is not difficult. Deleting a non-leaf node requires several steps.

Accepted Answer

A) True 
 B)False

Question 2

Output will be the same if you use inorder, postorder, or preorder traversals of the same binary tree.

Accepted Answer

A) True 
 B)False

Question 3

When working with a binary tree, a node that has more than two children:

Accepted Answer

A) will be cut back by the compiler 
B) is theoretically impossible in a correctly-developed binary tree structure 
C) is known as a triplet node 
D) None of these 
A) will be cut back by the compiler 
B) is theoretically impossible in a correctly-developed binary tree structure 
C) is known as a triplet node 
D) None of these

Question 4

Methods of traversing a binary tree are:

Accepted Answer

A) inorder traversal 
B) preorder traversal 
C) postorder traversal 
D) All of these 
E) None of these 
A) inorder traversal 
B) preorder traversal 
C) postorder traversal 
D) All of these 
E) None of these

Question 5

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

Accepted Answer

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

Question 6

A binary tree with a height of three has:

Accepted Answer

A) six nodes 
B) one root and three nodes with two children each 
C) three levels 
D) three subtrees 
E) None of these 
A) six nodes 
B) one root and three nodes with two children each 
C) three levels 
D) three subtrees 
E) None of these

Question 7

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

Accepted Answer

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

Question 8

To remove a node that has children, you must first remove the children.

Accepted Answer

A) True 
 B)False

Question 9

All node pointers that do not point to other nodes are set to:

Accepted Answer

A) the root of the tree 
B) a parent node 
C) their left-most child node 
D) a null pointer 
E) None of these 
A) the root of the tree 
B) a parent node 
C) their left-most child node 
D) a null pointer 
E) None of these

Question 10

All nodes to the right of a node hold values greater than the node's value.

Accepted Answer

A) True 
 B)False

Question 11

The width of a tree is the largest number of nodes in the same level.

Accepted Answer

A) True 
 B)False

Question 12

The inorder, preorder, and postorder traversals can be accomplished using ________.

Accepted Answer

A) recursion 
B) no pointers 
C) no arguments 
D) no parameters 
E) None of these 
A) recursion 
B) no pointers 
C) no arguments 
D) no parameters 
E) None of these

Question 13

Dereferencing a pointer to a pointer gives you another pointer.

Accepted Answer

A) True 
 B)False

Question 14

In a binary tree, each node may point to ________ other nodes.

Accepted Answer

A) no 
B) one 
C) two 
D) All of these 
E) None of these 
A) no 
B) one 
C) two 
D) All of these 
E) None of these

Question 15

In a binary tree, each node must have a minimum of two children.

Accepted Answer

A) True 
 B)False

Question 16

An operation that can be performed on a binary search tree is:

Accepted Answer

A) insertion 
B) finding 
C) deleting 
D) All of these 
E) None of these 
A) insertion 
B) finding 
C) deleting 
D) All of these 
E) None of these

Question 17

The first node in a binary tree list is called the ________.

Accepted Answer

A) head pointer 
B) binary node 
C) root node 
D) pointer node 
E) None of these 
A) head pointer 
B) binary node 
C) root node 
D) pointer node 
E) None of these

Question 18

When the root node points to two other nodes, the nodes are referred to as ________.

Accepted Answer

A) child nodes, or children 
B) parent nodes, or parents 
C) binary nodes 
D) subnodes 
E) None of these 
A) child nodes, or children 
B) parent nodes, or parents 
C) binary nodes 
D) subnodes 
E) None of these

Deleting a leaf node from a binary tree is not difficult. Deleting a non-leaf node requires several steps.

Output will be the same if you use inorder, postorder, or preorder traversals of the same binary tree.

When working with a binary tree, a node that has more than two children:

Methods of traversing a binary tree are:

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

A binary tree with a height of three has:

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

To remove a node that has children, you must first remove the children.

All node pointers that do not point to other nodes are set to:

All nodes to the right of a node hold values greater than the node's value.

The width of a tree is the largest number of nodes in the same level.

The inorder, preorder, and postorder traversals can be accomplished using ________.

Dereferencing a pointer to a pointer gives you another pointer.

In a binary tree, each node may point to ________ other nodes.

In a binary tree, each node must have a minimum of two children.

An operation that can be performed on a binary search tree is:

The first node in a binary tree list is called the ________.

When the root node points to two other nodes, the nodes are referred to as ________.

Introduction to Computers and Programming

Introduction to C Plus Plus

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays

Searching and Sorting Arrays

Pointers

Characters, C-Strings, and More About the String Class

Structured Data

Advanced File Operations

Introduction to Classes

More About Classes

Inheritance, Polymorphism, and Virtual Functions

Exceptions, Templates, and the Standard Template Library Stl

Linked Lists

Stacks and Queues

Recursion

Filters

Exam 20: Binary Trees

Deleting a leaf node from a binary tree is not difficult. Deleting a non-leaf node requires several steps.

Output will be the same if you use inorder, postorder, or preorder traversals of the same binary tree.

When working with a binary tree, a node that has more than two children:

Methods of traversing a binary tree are:

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

A binary tree with a height of three has:

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

To remove a node that has children, you must first remove the children.

All node pointers that do not point to other nodes are set to:

All nodes to the right of a node hold values greater than the node's value.

The width of a tree is the largest number of nodes in the same level.

The inorder, preorder, and postorder traversals can be accomplished using ________.

Dereferencing a pointer to a pointer gives you another pointer.

In a binary tree, each node may point to ________ other nodes.

In a binary tree, each node must have a minimum of two children.

An operation that can be performed on a binary search tree is:

The first node in a binary tree list is called the ________.

When the root node points to two other nodes, the nodes are referred to as ________.

Introduction to Computers and Programming

Introduction to C Plus Plus

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays

Searching and Sorting Arrays

Pointers

Characters, C-Strings, and More About the String Class

Structured Data

Advanced File Operations

Introduction to Classes

More About Classes

Inheritance, Polymorphism, and Virtual Functions

Exceptions, Templates, and the Standard Template Library Stl

Linked Lists

Stacks and Queues

Recursion

Filters