Question 1

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

Question 2

Consider the following tree diagrams:  
Which tree represents the arithmetic expression (2 + 5)$\times$ 4?

Accepted Answer

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

Question 3

Which of the following is NOT a property of a red-black tree?

Accepted Answer

A)  All nodes must be red or black. 
B)  All child nodes of a red node must be black. 
C)  The root is black. 
D)  All paths from root to null have the name number of nodes.

Question 4

Consider the following tree diagrams:  Which of the above are binary search trees?

Accepted Answer

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

Question 5

Removing an element from a balanced binary search tree takes ____ time.

Accepted Answer

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

Question 6

Consider the following tree diagrams:  
Which tree represents the arithmetic expression 2 + 5 $\times$ 4?

Accepted Answer

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

Question 7

If the postorder traversal of an expression tree is 8, 2, +, 5, /, what is the numeric result of that Reverse Polish Notation expression?

Accepted Answer

A)  15 
B)  8 
C)  7 
D)  2

Question 8

Consider the following binary search tree:  Which of the following sequences correctly represents breadth-first traversal of this tree?

Accepted Answer

A)  J, E, M, A, G, P, C, H, N 
B)  A, C, H, G, E, N, P, M, J 
C)  J, E, A, G, C, H, M, P, N 
D)  A, C, E, G, H, J, M, N, P

Question 9

Locating an element in a balanced binary search tree takes ____ time.

Accepted Answer

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

Question 10

Consider the following tree diagram:  Which of the following statements is NOT correct?

Accepted Answer

A)  Nodes D and K form a subtree 
B)  Nodes H, M, and X form a subtree 
C)  Nodes R and N form a subtree 
D)  Nodes L and T form a subtree

Question 11

Which of the following sequences of insertions will result in a balanced tree?
I 12 , 7, 25, 6, 9, 13, 44
II 12 , 7, 25, 44, 13, 6, 9
III 12, 25, 44, 13, 6, 9, 7

Accepted Answer

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

Question 12

Which of the following statements about binary trees is correct?

Accepted Answer

A)  Each node in a binary tree has at least two child nodes. 
B)  Each node in a binary tree has at most two child nodes. 
C)  The number of child nodes for each node in a binary tree is any power of two. 
D)  If divided down the middle from top to bottom, a binary tree must be symmetrical.

Question 13

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

Accepted Answer

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

Question 14

If the child references of a binary tree node are both null, the node is ____.

Accepted Answer

A)  a root node 
B)  a leaf node 
C)  a parent node 
D)  an interior node

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.

Question 16

As implemented in the textbook, a tree class contains which of the following?
I Node class
II Root node
III List of child nodes

Accepted Answer

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

Question 17

Consider the following tree diagrams:  Which are binary search trees?

Accepted Answer

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

Question 18

Consider the following tree diagrams:  
Which tree represents the arithmetic expression 2 $\times$ 5 + 4?

Accepted Answer

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

Question 19

You wish to traverse a binary search tree using postorder 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

Question 20

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

Accepted Answer

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

Exam 17: Tree Structures

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

Consider the following tree diagrams: $Consider the following tree diagrams: Which tree represents the arithmetic expression (2 + 5) \times 4? A) I B) II C) Both I and II D) Neither I nor II$ Which tree represents the arithmetic expression (2 + 5) $\times$ 4?

Which of the following is NOT a property of a red-black tree?

Consider the following tree diagrams: Which of the above are binary search trees?

Removing an element from a balanced binary search tree takes ____ time.

Consider the following tree diagrams: $Consider the following tree diagrams: Which tree represents the arithmetic expression 2 + 5 \times 4? A) I B) II C) Both I and II D) Neither I nor II$ Which tree represents the arithmetic expression 2 + 5 $\times$ 4?

If the postorder traversal of an expression tree is 8, 2, +, 5, /, what is the numeric result of that Reverse Polish Notation expression?

Consider the following binary search tree: Which of the following sequences correctly represents breadth-first traversal of this tree?

Locating an element in a balanced binary search tree takes ____ time.

Consider the following tree diagram: Which of the following statements is NOT correct?

Which of the following sequences of insertions will result in a balanced tree? I 12 , 7, 25, 6, 9, 13, 44 II 12 , 7, 25, 44, 13, 6, 9 III 12, 25, 44, 13, 6, 9, 7

Which of the following statements about binary trees is correct?

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

If the child references of a binary tree node are both null, the node is ____.

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

As implemented in the textbook, a tree class contains which of the following? I Node class II Root node III List of child nodes

Consider the following tree diagrams: Which are binary search trees?

Consider the following tree diagrams: $Consider the following tree diagrams: Which tree represents the arithmetic expression 2 \times 5 + 4? A) I B) II C) Both I and II D) Neither I nor II$ Which tree represents the arithmetic expression 2 $\times$ 5 + 4?

You wish to traverse a binary search tree using postorder 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

Exam 17: Tree Structures

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

Consider the following tree diagrams: Which tree represents the arithmetic expression (2 + 5) ×\times× 4?

Which of the following is NOT a property of a red-black tree?

Consider the following tree diagrams: Which of the above are binary search trees?

Removing an element from a balanced binary search tree takes ____ time.

Consider the following tree diagrams: Which tree represents the arithmetic expression 2 + 5 ×\times× 4?

If the postorder traversal of an expression tree is 8, 2, +, 5, /, what is the numeric result of that Reverse Polish Notation expression?

Consider the following binary search tree: Which of the following sequences correctly represents breadth-first traversal of this tree?

Locating an element in a balanced binary search tree takes ____ time.

Consider the following tree diagram: Which of the following statements is NOT correct?

Which of the following sequences of insertions will result in a balanced tree? I 12 , 7, 25, 6, 9, 13, 44 II 12 , 7, 25, 44, 13, 6, 9 III 12, 25, 44, 13, 6, 9, 7

Which of the following statements about binary trees is correct?

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

If the child references of a binary tree node are both null, the node is ____.

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

As implemented in the textbook, a tree class contains which of the following? I Node class II Root node III List of child nodes

Consider the following tree diagrams: Which are binary search trees?

Consider the following tree diagrams: Which tree represents the arithmetic expression 2 ×\times× 5 + 4?

You wish to traverse a binary search tree using postorder 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 arithmetic expression is represented by this tree?

Consider the following tree diagrams: $Consider the following tree diagrams: Which tree represents the arithmetic expression (2 + 5) \times 4? A) I B) II C) Both I and II D) Neither I nor II$ Which tree represents the arithmetic expression (2 + 5) $\times$ 4?

Consider the following tree diagrams: $Consider the following tree diagrams: Which tree represents the arithmetic expression 2 + 5 \times 4? A) I B) II C) Both I and II D) Neither I nor II$ Which tree represents the arithmetic expression 2 + 5 $\times$ 4?

Consider the following tree diagrams: $Consider the following tree diagrams: Which tree represents the arithmetic expression 2 \times 5 + 4? A) I B) II C) Both I and II D) Neither I nor II$ Which tree represents the arithmetic expression 2 $\times$ 5 + 4?