Question 1

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

Accepted Answer

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

Question 2

What is the efficiency of adding an element to a red-black tree?

Accepted Answer

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

Question 3

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

Accepted Answer

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

Question 4

Which of the following statements about the three tree traversal schemes studied is correct?

Accepted Answer

A)  Inorder traversal is used for evaluating arithmetic expression trees on a stack-based calculator. 
B)  Postorder traversal is used for copying file directories. 
C)  Inorder traversal is used for copying file directories. 
D)  Postorder traversal is used for removing file directories by removing subdirectories first. 
A)  Inorder traversal is used for evaluating arithmetic expression trees on a stack-based calculator. 
B)  Postorder traversal is used for copying file directories. 
C)  Inorder traversal is used for copying file directories. 
D)  Postorder traversal is used for removing file directories by removing subdirectories first.

Question 5

Consider the following tree diagram:   What is the size of the subtree with root R?

Accepted Answer

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

Question 6

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

Accepted Answer

A)  3 
B)  4 
C)  5 
D)  7 
A)  3 
B)  4 
C)  5 
D)  7

Question 7

What is the efficiency of locating an element in a red-black tree?

Accepted Answer

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

Question 8

Given the Node class discussed in section 17.1 (partially shown below), select a statement to complete the recursive method descendants, which is designed to return the number of descendants of a node. class Node
{
Public Object data;
Public List<Node> children;
) . .
Public int descendants()
{
Int num = 0;
For (Node child : children)
{
_____________________________
}
Return num;
}
}

Accepted Answer

A)  num = child.descendants(); 
B)  num = num + child.descendants(); 
C)  num = num + child.children.size(); 
D)  num = num + child.descendants() + 1; 
A)  num = child.descendants(); 
B)  num = num + child.descendants(); 
C)  num = num + child.children.size(); 
D)  num = num + child.descendants() + 1;

Question 9

Consider the following tree diagram:   What is the height of the subtree with root R?

Accepted Answer

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

Question 10

You wish to traverse a binary search tree in sorted order using preorder traversal. Arrange the following actions in the correct order to accomplish this.
I Print the right subtree recursively
II Print the root
III Print the left subtree recursively

Accepted Answer

A)  I, II, III 
B)  III, II, I 
C)  II, III, I 
D)  III, I, II 
A)  I, II, III 
B)  III, II, I 
C)  II, III, I 
D)  III, I, II

Question 11

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

Accepted Answer

A)  H 
B)  N 
C)  H and P 
D)  H, N, and P 
A)  H 
B)  N 
C)  H and P 
D)  H, N, and P

Question 12

Insert the missing code in the following code fragment. This fragment is intended to create an iterator to be used to process elements of a tree. TreeSet<String> aTree = . . .
String first = iter.next();
String second = iter.next();

Accepted Answer

A) Iterator iter = aTree.iterator(); B) Iterator iter = aTree.iterator(); C) Iterator iter = String.iterator(); D) Iterator iter = aTree.iterator(); A) Iterator iter = aTree.iterator(); B) Iterator iter = aTree.iterator(); C) Iterator iter = String.iterator(); D) Iterator iter = aTree.iterator();

Question 13

If the postorder traversal visits the nodes of a binary tree storing character values in the order of U, G, T, R, A, I, what is the value of the root of the tree?

Accepted Answer

A)  I 
B)  U 
C)  T 
D)  cannot be determined 
A)  I 
B)  U 
C)  T 
D)  cannot be determined

Question 14

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

Accepted Answer

A)  C 
B)  R 
C)  P 
D)  R and P 
A)  C 
B)  R 
C)  P 
D)  R and P

Question 15

Which of the following statements about inserting a node into a red-black tree is NOT correct?

Accepted Answer

A)  If it is the first node, it must be black. 
B)  Color the new node red. 
C)  If the parent of the new node is red, no other actions are required. 
D)  A double-red result can occur in a left subtree or a right subtree. 
A)  If it is the first node, it must be black. 
B)  Color the new node red. 
C)  If the parent of the new node is red, no other actions are required. 
D)  A double-red result can occur in a left subtree or a right subtree.

Question 16

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

Accepted Answer

A)  Adding elements that are already sorted will result in a balanced binary search tree. 
B)  Nodes must be moved when a node is removed from the middle of a subtree. 
C)  The speed of inserting or removing a node is dependent on the shape of the tree. 
D)  The speed of inserting or removing a node is dependent on the number of subtrees. 
A)  Adding elements that are already sorted will result in a balanced binary search tree. 
B)  Nodes must be moved when a node is removed from the middle of a subtree. 
C)  The speed of inserting or removing a node is dependent on the shape of the tree. 
D)  The speed of inserting or removing a node is dependent on the number of subtrees.

Question 17

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

Accepted Answer

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

Question 18

Which of the following statements about inserting a node into a red-black tree is correct?

Accepted Answer

A)  If it is the first node, it must be red. 
B)  Color the new node black. 
C)  If the parent of the new node is red, no other actions are required. 
D)  If a double-red situation results, you must correct this. 
A)  If it is the first node, it must be red. 
B)  Color the new node black. 
C)  If the parent of the new node is red, no other actions are required. 
D)  If a double-red situation results, you must correct this.

Question 19

Consider the following tree diagram:   What is the height of the subtree with root P?

Accepted Answer

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

Question 20

In a binary search tree, where the root node data value = 45, what do we know about the data values of all the descendants in the left subtree of the root?

Accepted Answer

A)  the root's left child value  45 
B)  some values will be  45 
C)  approximately half the values are  45 
D)  all will be < 45 
A)  the root's left child value  45 
B)  some values will be  45 
C)  approximately half the values are  45 
D)  all will be < 45

Exam 17: Tree Structures

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

What is the efficiency of adding an element to a red-black tree?

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

Which of the following statements about the three tree traversal schemes studied is correct?

Consider the following tree diagram: What is the size of the subtree with root R?

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

What is the efficiency of locating an element in a red-black tree?

Consider the following tree diagram: What is the height of the subtree with root R?

You wish to traverse a binary search tree in sorted order using preorder traversal. Arrange the following actions in the correct order to accomplish this. I Print the right subtree recursively II Print the root III Print the left subtree recursively

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

Insert the missing code in the following code fragment. This fragment is intended to create an iterator to be used to process elements of a tree. TreeSet<String> aTree = . . . String first = iter.next(); String second = iter.next();

If the postorder traversal visits the nodes of a binary tree storing character values in the order of U, G, T, R, A, I, what is the value of the root of the tree?

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

Which of the following statements about inserting a node into a red-black tree is NOT correct?

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

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

Which of the following statements about inserting a node into a red-black tree is correct?

Consider the following tree diagram: What is the height of the subtree with root P?

In a binary search tree, where the root node data value = 45, what do we know about the data values of all the descendants in the left subtree of the root?

Introduction

Using Objects

Implementing Classes

Fundamental Data Types

Decisions

Loops

Arrays and Array Lists

Designing Classes

Inheritance

Interfaces

Inputoutput and Exception Handling

Object-Oriented Design

Recursion

Sorting and Searching

The Java Collections Framework

Basic Data Structures

Generic Classes

Graphical User Interfaces

Streams and Binary Inputoutput

Multithreading

Internet Networking

Relational Databases

XML

Web Applications

Filters