Question 1

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)   that it is more flexible than the unary tree structure
E)   None of theseF) A) and E)
G) B) and C)

Question 2

Select all that apply. Which of the following are methods of traversing a binary tree?

Accepted Answer

A)   LeftOrder traversal
B)   PreOrder traversal
C)   FrontOrder traversal
D)   InOrder traversal
E)   PostOrder traversalF) A) and D)
G) A) and E)

Question 3

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 4

Values are typically stored in a binary search tree so that a node's __________ child holds data that 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 theseF) A) and E)
G) A) and D)

Question 5

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

Accepted Answer

A) True 
 B)False

Question 6

The process of stepping through the nodes of a binary tree is known as

Accepted Answer

A)   climbing
B)   traversing
C)   stepping through
D)   branching out
E)   None of theseF) A) and E)
G) B) and D)

Question 7

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

Accepted Answer

A) True 
 B)False

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 theseF) B) and D)
G) B) and C) D

Question 9

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 theseF) All of the above
G) B) and C)

Question 10

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 theseF) A) and C)
G) A) and B)

Question 11

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

Accepted Answer

A) True 
 B)False

Question 12

Select all that apply. The head pointer, anchored at the top of a binary tree, may be called the

Accepted Answer

A)   root node
B)   tree pointer
C)   binary pointer
D)   leaf pointer
E)   node pointerF) B) and C)
G) B) and D)

Question 13

The intBinaryTree class has a public member function, findNode, that returns true if a value is not found and False if the value is found.

Accepted Answer

A) True 
 B)False

Question 14

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

Accepted Answer

A)   a value of the data type that is pointed to
B)   another pointer
C)   not possible to determine
D)   a null pointer
E)   None of theseF) B) and D)
G) C) and D) B

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 theseF) B) and E)
G) A) and B)

Question 16

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

Accepted Answer

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

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 theseF) A) and C)
G) A) and E)

Question 18

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 theseF) A) and C)
G) All of the above

Question 19

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

Accepted Answer

A) True 
 B)False

Question 20

Select all that apply. Binary trees may be implemented as templates, but any data types used with them must support the __________ operator.

Accepted Answer

A)   >
B)   
C)   &&
D)   ==
E)   linkedF) C) and D)
G) A) and C) A, B, D

Exam 21: Binary Trees

A good reason to use the binary tree structure is

Correct AnswerverifiedShow Answer

Select all that apply. Which of the following are methods of traversing a binary tree?

Correct AnswerverifiedShow Answer

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.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

The process of stepping through the nodes of a binary tree is known as

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

The shape of a binary tree is

Correct AnswerverifiedD

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

Correct AnswerverifiedShow Answer

A binary tree with a height of three has

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Select all that apply. The head pointer, anchored at the top of a binary tree, may be called the

Correct AnswerverifiedShow Answer

The intBinaryTree class has a public member function, findNode, that returns true if a value is not found and False if the value is found.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedB

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

The first node in a binary tree list is called the

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Select all that apply. Binary trees may be implemented as templates, but any data types used with them must support the __________ operator.

Correct AnswerverifiedA, B, D

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

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

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
D

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
B

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
A, B, D