Question 1

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 C

Question 2

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 D

Question 3

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 4

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 5

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

Accepted Answer

A) True 
 B)False

Question 6

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 7

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

Accepted Answer

A) True 
 B)False

Question 8

The root node points to two other nodes, 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

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

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

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 12

Dereferencing a pointer to a pointer gives you another pointer.

Accepted Answer

A) True 
 B)False

Question 13

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 14

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 15

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 16

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

Accepted Answer

A) True 
 B)False

Question 17

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

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 19

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 20

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

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

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

Binary trees can be divided into

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

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

The shape of a binary tree is:

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

The root node points to two other nodes, referred to as

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

In a binary tree, a node that has more than two children:

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

Dereferencing a pointer to a pointer gives you another pointer.

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

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

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

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

A strong reason to use the binary tree structure is:

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

The first node in a binary tree list is called the

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

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

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

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

Binary trees can be divided into

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

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

The shape of a binary tree is:

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

The root node points to two other nodes, referred to as

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

In a binary tree, a node that has more than two children:

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

Dereferencing a pointer to a pointer gives you another pointer.

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

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

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

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

A strong reason to use the binary tree structure is:

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

The first node in a binary tree list is called the

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

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