Question 1

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)  NULL 
E)  None of these 
A)  the root of the tree 
B)  a parent node 
C)  their left-most child node 
D)  NULL 
E)  None of these

Question 2

When you dereference a pointer to a pointer, the result is:

Accepted Answer

A)  a value of the data type pointed to 
B)  another pointer 
C)  not possible to determine 
D)  NULL 
E)  None of these 
A)  a value of the data type pointed to 
B)  another pointer 
C)  not possible to determine 
D)  NULL 
E)  None of these

Question 3

A node that has no children is a

Accepted Answer

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

Question 4

The head pointer, anchored at the top of a tree, is called the

Accepted Answer

A)  root node 
B)  tree pointer 
C)  binary pointer 
D)  either a or c 
E)  None of these 
A)  root node 
B)  tree pointer 
C)  binary pointer 
D)  either a or c 
E)  None of these

Question 5

Methods of traversing a 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 6

The binary tree structure is called a "tree" because it resembles an upside-down tree.

Accepted Answer

A) True 
 B)False

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

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 9

A 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 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

Values are typically stored in a binary search tree so that a node's _________ child holds data is less than the ___________ data.

Accepted Answer

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

Question 12

The inorder method of traversing a binary tree involves traversing the node's left subtree, processing the node's data, then traversing the node's right subtree.

Accepted Answer

A) True 
 B)False

Question 13

The preorder method of traversing a binary tree involves processing the node's data, traversing the node's left subtree, then traversing the node's right subtree.

Accepted Answer

A) True 
 B)False

Question 14

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 15

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

Accepted Answer

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

Question 16

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 17

Stepping through the nodes of a tree is known as:

Accepted Answer

A)  climbing 
B)  traversing 
C)  walking through 
D)  branching out 
E)  None of these 
A)  climbing 
B)  traversing 
C)  walking through 
D)  branching out 
E)  None of these

Question 18

A subtree is an entire branch of a tree, from one particular node down.

Accepted Answer

A) True 
 B)False

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

When you dereference a pointer to a pointer, the result is:

A node that has no children is a

The head pointer, anchored at the top of a tree, is called the

Methods of traversing a tree are:

The binary tree structure is called a "tree" because it resembles an upside-down tree.

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

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

A tree with a height of three has:

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

Values are typically stored in a binary search tree so that a node's _ child holds data is less than the ___ data.

The inorder method of traversing a binary tree involves traversing the node's left subtree, processing the node's data, then traversing the node's right subtree.

The preorder method of traversing a binary tree involves processing the node's data, traversing the node's left subtree, then traversing the node's right subtree.

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

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

Inorder, Preorder, and Postorder traversals can be accomplished using _____.

Stepping through the nodes of a tree is known as:

A subtree is an entire branch of a tree, from one particular node down.

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays

Searching and Sorting Arrays

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

Structured Data

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

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

When you dereference a pointer to a pointer, the result is:

A node that has no children is a

The head pointer, anchored at the top of a tree, is called the

Methods of traversing a tree are:

The binary tree structure is called a "tree" because it resembles an upside-down tree.

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

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

A tree with a height of three has:

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

Values are typically stored in a binary search tree so that a node's _________ child holds data is less than the ___________ data.

The inorder method of traversing a binary tree involves traversing the node's left subtree, processing the node's data, then traversing the node's right subtree.

The preorder method of traversing a binary tree involves processing the node's data, traversing the node's left subtree, then traversing the node's right subtree.

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

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

Inorder, Preorder, and Postorder traversals can be accomplished using _____.

Stepping through the nodes of a tree is known as:

A subtree is an entire branch of a tree, from one particular node down.

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays

Searching and Sorting Arrays

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

Structured Data

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

Values are typically stored in a binary search tree so that a node's _ child holds data is less than the ___ data.