Question 1

Consider the following tree diagram:   Which of the following nodes are child nodes?

Accepted Answer

A) C 
B) C and P 
C) C and X 
D) P and X 
A) C 
B) C and P 
C) C and X 
D) P and X

Question 2

Which of the following statements about a binary search tree is correct?

Accepted Answer

A) You can specify an insert position for inserting a node in the tree. 
B) Locating an element in a balanced binary search tree takes O(n) time. 
C) The speed of inserting or removing a node is dependent on the shape of the tree. 
D) Adding elements that are already sorted will result in a balanced binary search tree. 
A) You can specify an insert position for inserting a node in the tree. 
B) Locating an element in a balanced binary search tree takes O(n) time. 
C) The speed of inserting or removing a node is dependent on the shape of the tree. 
D) Adding elements that are already sorted will result in a balanced binary search tree.

Question 3

Consider the following tree diagrams:   Which of these trees is considered to be balanced?

Accepted Answer

A) II and III only 
B) I only 
C) I and II only 
D) I and III only 
A) II and III only 
B) I only 
C) I and II only 
D) I and III only

Question 4

Consider the following binary search tree diagram:   Consider the following addNode method for inserting a newNode into a binary search tree:
public void addNode(Node newNode)
{
int comp = newnode.data.compareTo(data);
if (comp < 0)
{
if (left == null) {left = newNode;}
else { left.addNode(newNode); }
}
else
{
if (right == null) {right = newNode;}
else { right.addNode(newNode); }
}
}
Which nodes will be visited in order to insert the letter E into this tree, calling addNode on the root of the tree?

Accepted Answer

A) H only 
B) H and D only 
C) H, D, and A 
D) H, D, and F 
A) H only 
B) H and D only 
C) H, D, and A 
D) H, D, and F

Question 5

Consider the following tree diagram:   What is the size of this tree?

Accepted Answer

A) 5 
B) 6 
C) 4 
D) 13 
A) 5 
B) 6 
C) 4 
D) 13

Question 6

If the postorder traversal of an expression tree is, 8, 2, +, 5, /, what is the result of an inorder traversal?

Accepted Answer

A) +, /, 8, 2, 5 
B) 8, +, 2, /, 5 
C) /, +, 2, 8, 5 
D) /, +, 8, 2, 5 
A) +, /, 8, 2, 5 
B) 8, +, 2, /, 5 
C) /, +, 2, 8, 5 
D) /, +, 8, 2, 5

Question 7

Consider the following Huffman encoding tree:   The letter K will be encoded as ____.

Accepted Answer

A) 10 
B) 001 
C) 010 
D) 100 
A) 10 
B) 001 
C) 010 
D) 100

Question 8

A completely filled binary tree with a height of 4 has ____ nodes.

Accepted Answer

A) 16 
B) 12 
C) 8 
D) 15 
A) 16 
B) 12 
C) 8 
D) 15

Question 9

Consider the following tree diagrams:   Which tree represents the arithmetic expression 2 + 5 * 4?

Accepted Answer

A) Neither I nor II 
B) Both I and II 
C) II only 
D) I only 
A) Neither I nor II 
B) Both I and II 
C) II only 
D) I only

Question 10

If a min-heap has 15 nodes, what is known for certain?
i.every level of the tree is fully occupied
II.at least one level is missing a node
III.the root contains the smallest element

Accepted Answer

A) I and III only 
B) II only 
C) II and III only 
D) I only 
A) I and III only 
B) II only 
C) II and III only 
D) I only

Question 11

Which of the following statements about trees is NOT correct?

Accepted Answer

A) The height of a tree is based on the longest path from the root to a leaf. 
B) Many tree properties are computed with recursive methods. 
C) A simple implementation of a Tree class uses an instance variable for the root node and a nested Node class, which stores the node's data and its children. 
D) A subtree rooted at node n is the tree formed by taking n as the root node and including all of its ancestors. 
A) The height of a tree is based on the longest path from the root to a leaf. 
B) Many tree properties are computed with recursive methods. 
C) A simple implementation of a Tree class uses an instance variable for the root node and a nested Node class, which stores the node's data and its children. 
D) A subtree rooted at node n is the tree formed by taking n as the root node and including all of its ancestors.

Question 12

Consider the following tree diagram:   Which arithmetic expression is represented by this tree?

Accepted Answer

A) (2 + 3) + (5 * 4) * 6 * (- 1) 
B) [(2 + 3) + (5 * 4)] * (6 - 1) 
C) 2 + 3 + 5 * 4 - 6 - 1 
D) (2 + 3) * (5 * 4) * (6 - 1) 
A) (2 + 3) + (5 * 4) * 6 * (- 1) 
B) [(2 + 3) + (5 * 4)] * (6 - 1) 
C) 2 + 3 + 5 * 4 - 6 - 1 
D) (2 + 3) * (5 * 4) * (6 - 1)

Question 13

A balanced binary tree with 260 nodes has a height of approximately ____.

Accepted Answer

A) 13 
B) 8 
C) 12 
D) 10 
A) 13 
B) 8 
C) 12 
D) 10

Question 14

If both of the child references of a binary tree node are non-null, it follows that the node must be ____.

Accepted Answer

A) a child node 
B) the root node 
C) a leaf node 
D) an interior node 
A) a child node 
B) the root node 
C) a leaf node 
D) an interior node

Question 15

Consider the following tree diagrams:   Which tree represents the arithmetic expression 2 * 5 + 4?

Accepted Answer

A) I only 
B) Both I and II 
C) Neither I nor II 
D) II only 
A) I only 
B) Both I and II 
C) Neither I nor II 
D) II only

Question 16

Adding an element to an unbalanced binary search tree takes ____ time.

Accepted Answer

A) O(n) 
B) O(1) 
C) O(log (n)) 
D) O(n2) 
A) O(n) 
B) O(1) 
C) O(log (n)) 
D) O(n2)

Question 17

When we map a min-heap with n elements to an array with n + 1 elements, the right child of the root is stored at which array index?

Accepted Answer

A) 2 
B) 1 
C) 3 
D) 4 
A) 2 
B) 1 
C) 3 
D) 4

Question 18

Consider the following tree diagram:   Which of the following nodes are siblings?

Accepted Answer

A) H and M 
B) D and B 
C) D and U 
D) L and T 
A) H and M 
B) D and B 
C) D and U 
D) L and T

Question 19

Removing an element from an unbalanced binary search tree takes ____ time.

Accepted Answer

A) O(log (n)) 
B) O(n) 
C) O(1) 
D) O(n2) 
A) O(log (n)) 
B) O(n) 
C) O(1) 
D) O(n2)

Question 20

Consider the following binary search tree diagram:   Consider the following pseudocode for the removal of a node n in a binary search tree:

If node Y is to be removed, which action should be taken?

Accepted Answer

A) Modify V's right reference to point to X. 
B) Modify V to have a null right pointer. 
C) Modify V's left reference to point to X. 
D) Swap the values in V and X, and modify X's right reference to point to V. 
A) Modify V's right reference to point to X. 
B) Modify V to have a null right pointer. 
C) Modify V's left reference to point to X. 
D) Swap the values in V and X, and modify X's right reference to point to V.

Exam 17: Tree Structures

Consider the following tree diagram: Which of the following nodes are child nodes?

Which of the following statements about a binary search tree is correct?

Consider the following tree diagrams: Which of these trees is considered to be balanced?

Consider the following tree diagram: What is the size of this tree?

If the postorder traversal of an expression tree is, 8, 2, +, 5, /, what is the result of an inorder traversal?

Consider the following Huffman encoding tree: The letter K will be encoded as ____.

A completely filled binary tree with a height of 4 has ____ nodes.

Consider the following tree diagrams: Which tree represents the arithmetic expression 2 + 5 * 4?

If a min-heap has 15 nodes, what is known for certain? i.every level of the tree is fully occupied II.at least one level is missing a node III.the root contains the smallest element

Which of the following statements about trees is NOT correct?

Consider the following tree diagram: Which arithmetic expression is represented by this tree?

A balanced binary tree with 260 nodes has a height of approximately ____.

If both of the child references of a binary tree node are non-null, it follows that the node must be ____.

Consider the following tree diagrams: Which tree represents the arithmetic expression 2 * 5 + 4?

Adding an element to an unbalanced binary search tree takes ____ time.

When we map a min-heap with n elements to an array with n + 1 elements, the right child of the root is stored at which array index?

Consider the following tree diagram: Which of the following nodes are siblings?

Removing an element from an unbalanced binary search tree takes ____ time.

Consider the following binary search tree diagram: Consider the following pseudocode for the removal of a node n in a binary search tree: If node Y is to be removed, which action should be taken?

Introduction

Using Objects

Implementing Classes

Fundamental Data Types

Decisions

Loops

Arrays and Array Lists

Designing Classes

Inheritance

Interfaces

Input/Output and Exception Handling

Object-Oriented Design

Recursion

Sorting and Searching

The Java Collections Framework

Basic Data Structures

Generic Classes

Stream Processing

Graphical User Interfaces

Advanced Input/Output

Multithreading

Internet Networking

Relational Databases

XML

Filters