Question 1

Binary trees can be divided into:

Accepted Answer

A) branches 
B) leaves 
C) subtrees 
D) sawdust 
E) None of these 
A) branches 
B) leaves 
C) subtrees 
D) sawdust 
E) None of these C

Question 2

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 B

Question 3

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) a null pointer 
E) None of these 
A) a value of the data type pointed to 
B) another pointer 
C) not possible to determine 
D) a null pointer 
E) None of these B

Question 4

The head pointer, anchored at the top of a binary 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

In a binary tree class, you usually have a pointer as a member that is set to ________.

Accepted Answer

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

Question 6

Binary trees may be implemented as templates, but any data types used with them must support the ________ operator.

Accepted Answer

A)  
C) == 
D) All of these 
E) None of these 
A)  
C) == 
D) All of these 
E) None of these

Question 7

In a non-linear linked list, a node can point to:

Accepted Answer

A) only the next node in sequence 
B) only the previous node in sequence 
C) more than one other node, plus the previous node in sequence 
D) all of the other nodes in the list 
E) None of these 
A) only the next node in sequence 
B) only the previous node in sequence 
C) more than one other node, plus the previous node in sequence 
D) all of the other nodes in the list 
E) None of these

Question 8

The shape of a binary tree is ________.

Accepted Answer

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

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

Binary trees are commonly used to organize key values that index database records.

Accepted Answer

A) True 
 B)False

Question 11

A node that has no children is known as 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 12

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

A good reason to use the binary tree structure is:

Accepted Answer

A) to expedite the process of searching large sets of information 
B) aesthetics and program design 
C) code readability 
D) it is more flexible than the Unary Tree structure 
E) None of these 
A) to expedite the process of searching large sets of information 
B) aesthetics and program design 
C) code readability 
D) it is more flexible than the Unary Tree structure 
E) None of these

Question 15

A binary tree can be created using a struct or class containing a data value and ________.

Accepted Answer

A) a pointer to the first child node 
B) a pointer to the last child node 
C) two pointers, one for the left child and one for the right child 
D) two data nodes 
E) None of these 
A) a pointer to the first child node 
B) a pointer to the last child node 
C) two pointers, one for the left child and one for the right child 
D) two data nodes 
E) None of these

Question 16

Deleting a node that has two children offers an opportunity to use:

Accepted Answer

A) a function that returns a pointer to a pointer 
B) a function parameter that is a pointer to a pointer 
C) double indirection 
D) All of these 
E) None of these 
A) a function that returns a pointer to a pointer 
B) a function parameter that is a pointer to a pointer 
C) double indirection 
D) All of these 
E) None of these

Question 17

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

Accepted Answer

A) True 
 B)False

Question 18

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

Accepted Answer

A) True 
 B)False

Question 19

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

Accepted Answer

A) True 
 B)False

Question 20

The process of stepping through the nodes of a binary 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

Binary trees can be divided into:

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

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

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

In a binary tree class, you usually have a pointer as a member that is set to ________.

Binary trees may be implemented as templates, but any data types used with them must support the ________ operator.

In a non-linear linked list, a node can point to:

The shape of a binary tree is ________.

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

Binary trees are commonly used to organize key values that index database records.

A node that has no children is known as a ________.

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

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.

A good reason to use the binary tree structure is:

A binary tree can be created using a struct or class containing a data value and ________.

Deleting a node that has two children offers an opportunity to use:

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

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

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

The process of stepping through the nodes of a binary tree is known 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

Binary trees can be divided into:

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

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

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

In a binary tree class, you usually have a pointer as a member that is set to ________.

Binary trees may be implemented as templates, but any data types used with them must support the ________ operator.

In a non-linear linked list, a node can point to:

The shape of a binary tree is ________.

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

Binary trees are commonly used to organize key values that index database records.

A node that has no children is known as a ________.

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

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.

A good reason to use the binary tree structure is:

A binary tree can be created using a struct or class containing a data value and ________.

Deleting a node that has two children offers an opportunity to use:

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

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

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

The process of stepping through the nodes of a binary tree is known 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

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