Question 1

What does the left node reference of a newly inserted binary search tree node get set to?
A) depends where the node is inserted
B) it gets set to the left child of the new node, if one exists
C) always null
D) it gets set to the left child of the root, if it exists

Accepted Answer

When a new node is inserted into a binary search tree, its left and right child references are initially set to null, as it does not have any children yet.

Question 2

Consider the following binary search tree diagram:  If node M is to be removed, which action should be taken?
A) Replace M with the smallest value in its left subtree.
B) Replace M with the smallest value in its right subtree.
C) Replace M with the largest value in its left subtree.
D) Replace M with the largest value in its right subtree.

Accepted Answer

The answer of Consider the following binary search tree diagram:...

Question 3

The nodes in our binary search tree implement the Comparable interface. Which tree operations benefit from this design decision?
I add
II search
III delete
A) I
B) II
C) I and III
D) I, II and III

Accepted Answer

Implementing the Comparable interface allows nodes to be compared, which is essential for adding, searching, and deleting nodes in a binary search tree.

Question 4

Which of the following may occur as a result of an add operation, on a non-empty binary search tree?
I a new root is created
II the new node becomes the left child of the root
III the new node has a right child upon insertion
A) I
B) II
C) III
D) II and III

Accepted Answer

In a binary search tree, a new node can become the left child of the root if it is smaller than the root. A new root is not created during an add operation, and a new node does not have a right child upon insertion.

Question 5

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
A) I
B) II
C) I and II
D) I and III

Accepted Answer

I and II are correct because they both result in a balanced tree. In I, the tree is balanced because the left and right subtrees have the same height. In II, the tree is balanced because the left subtree has one more node than the right subtree, which is allowed in a balanced tree.

Question 6

If the child references of a binary tree node are both null, the node is ____.
A) a root node
B) a leaf node
C) a parent node
D) an interior node

Accepted Answer

A leaf node is a node with no children.

Question 7

Consider the following binary search tree diagram:  If node J is to be removed, which node should be copied into its location?
A) M
B) L
C) X
D) N

Accepted Answer

The answer of Consider the following binary search tree diagram:...

Question 8

If both of the child references of a binary tree node are non-null, it follows that the node must be ____.
A) a root node
B) a leaf node
C) a child node
D) an interior node

Accepted Answer

An interior node in a binary tree is a node that has both left and right children, meaning both child references are non-null.

Question 9

Consider the following binary search tree diagram:  Which of the following trees represents the correct result after inserting element B? 
A) I
B) II
C) III
D) IV

Accepted Answer

The answer of Consider the following binary search tree diagram:...

Question 10

Consider the following binary search tree diagram:  Which nodes will be visited in order to insert the letter E into this tree?
A) H
B) H and D
C) H, D, and F
D) H, D, and A

Accepted Answer

The answer of Consider the following binary search tree diagram:...

Question 11

In a binary search tree, where the root node data value = 45, what do we know about the values of all the descendants in the right subtree of the root? A) the root's right child value > 45, but the left child of the root's right child key is < 45 B) some values will be > 45, but there may be a few values < 45 C) approximately half the values are < 45, the other half are > 45 D) all will be > 45

Accepted Answer

In a binary search tree, all values in the right subtree of a node are greater than the node's value. Therefore, all descendants in the right subtree of the root with value 45 will be greater than 45.

Question 12

Consider the following tree diagrams:  Which of these trees is considered to be balanced?
A) I
B) I and II
C) II and III
D) I and III

Accepted Answer

The answer of Consider the following tree diagrams:  Which...

Question 13

Consider the following binary search tree diagram:  Which of the following trees represents the correct result after inserting element T? 
A) I
B) II
C) III
D) IV

Accepted Answer

The answer of Consider the following binary search tree diagram:...

Question 14

Consider the following tree diagrams:  Which of the above are binary search trees?
A) I
B) II
C) I and II
D) Neither I nor II

Accepted Answer

The answer of Consider the following tree diagrams:  Which...

Question 15

A binary search tree is made up of a collection of nodes organized with smaller data values on the left and greater values on the right relative to any node. Which of the following Node references must be instance variables of any implementation of a Node class?
I root
II left
III right
A) I
B) II and III
C) I and II
D) I, II and III

Accepted Answer

In a binary search tree, each node must have references to its left and right children to maintain the tree structure. The root is not an instance variable of a node but rather a reference to the top node of the tree in the tree class.

Question 16

Consider the following tree diagrams:  Which are binary search trees?
A) I
B) II
C) I and II
D) Neither I nor II

Accepted Answer

The answer of Consider the following tree diagrams:  Which...

Question 17

A binary search tree is made up of a collection of nodes organized with smaller data values on the left and greater values on the right, relative to any node. Which of the following Node references must be instance variables of any implementation of a BinarySearchTree class?
I root
II left
III right
A) I
B) II and III
C) I and II
D) I, II and III

Accepted Answer

The answer of A binary search tree is made up...

Question 18

Consider the following binary search tree diagram:  Which nodes will be visited in order to insert the letter B into this tree?
A) H
B) H and D
C) H, D, and F
D) H, D, and A

Accepted Answer

The answer of Consider the following binary search tree diagram:...

Question 19

Consider the following tree diagrams:  Which of these trees is considered to be unbalanced?
A) I
B) II
C) III
D) II and III

Accepted Answer

The answer of Consider the following tree diagrams:  Which...

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? A) the root's left child value < 45, but the right child of the root's left child value is > 45 B) some values will be < 45, but there may be a few values > 45 C) approximately half the values are < 45, the other half are > 45 D) all will be < 45

Accepted Answer

In a binary search tree, all values in the left subtree of a node are less than the node's value. Therefore, all descendants in the left subtree of the root with value 45 will have values less than 45.

Quiz 17: Tree Structures

What does the left node reference of a newly inserted binary search tree node get set to?

Consider the following binary search tree diagram: If node M is to be removed, which action should be taken?

The nodes in our binary search tree implement the Comparable interface. Which tree operations benefit from this design decision? I add II search III delete

Which of the following may occur as a result of an add operation, on a non-empty binary search tree? I a new root is created II the new node becomes the left child of the root III the new node has a right child upon insertion

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

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

Consider the following binary search tree diagram: If node J is to be removed, which node should be copied into its location?

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

Consider the following binary search tree diagram: Which of the following trees represents the correct result after inserting element B?

Consider the following binary search tree diagram: Which nodes will be visited in order to insert the letter E into this tree?

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

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

Consider the following binary search tree diagram: Which of the following trees represents the correct result after inserting element T?

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

A binary search tree is made up of a collection of nodes organized with smaller data values on the left and greater values on the right relative to any node. Which of the following Node references must be instance variables of any implementation of a Node class? I root II left III right

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

Consider the following binary search tree diagram: Which nodes will be visited in order to insert the letter B into this tree?

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

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?