Question 1

The Java Collections API provides two implementations of balanced binary search trees, ______ and ______, both of which use a red/black tree implementation.

Accepted Answer

The answer of The Java Collections API provides two implementations...

Question 2

The balance restriction on a red/black tree is somewhat less strict than that for AVL trees. However, in both cases, the find operation is order ______.

Accepted Answer

A)   n
B)   log n
C)   n log n
D)   None of the aboveE) B) and D)
F) A) and B)

Question 3

The ______ node in a binary search tree will contain the minimum element, while the ______ node will contain the maximum element.

Accepted Answer

The answer of The ______ node in a binary search...

Question 4

What is the difference between a TreeSet and a TreeMap?

Accepted Answer

Both are red/black tree implementations ...

Question 5

The leftmost node in a binary search tree will contain the minimum element, while the rightmost node will contain the maximum element.

Accepted Answer

A) True 
 B)False

Question 6

A binary search tree is a binary tree with the added property that the left child is less than the parent, which is less than or equal to the ___________.

Accepted Answer

A)   Left child
B)   Right child
C)   Middle child
D)   None of the aboveE) B) and C)
F) None of the above

Question 7

We noted that the balance restriction for a red/black tree is less strict than that of an AVL tree and yet we still claim that traversing the longest path in a red/black tree is still O(log n). Why?

Accepted Answer

Since no red node can have a red child, ...

Exam 10: Trees

We noted that the balance restriction for a red/black tree is less strict than that of an AVL tree and yet we still claim that traversing the longest path in a red/black tree is still O(log n). Why?

Correct Answer
verified
Since no red node can have a red child, ...
View Answer

The leftmost node in a binary search tree will contain the minimum element, while the rightmost node will contain the maximum element.

Correct Answer
verified

A binary search tree is a binary tree with the added property that the left child is less than the parent, which is less than or equal to the ___________.

Correct Answer
verified

The node in a binary search tree will contain the minimum element, while the node will contain the maximum element.

Correct Answer
verified

The balance restriction on a red/black tree is somewhat less strict than that for AVL trees. However, in both cases, the find operation is order ______.

Correct Answer
verified

What is the difference between a TreeSet and a TreeMap?

Correct Answer
verified
Both are red/black tree implementations ...
View Answer

The Java Collections API provides two implementations of balanced binary search trees, and , both of which use a red/black tree implementation.

Correct Answer
verified

Exam 10: Trees

We noted that the balance restriction for a red/black tree is less strict than that of an AVL tree and yet we still claim that traversing the longest path in a red/black tree is still O(log n). Why?

Correct AnswerverifiedSince no red node can have a red child, ...View AnswerShow Answer

The leftmost node in a binary search tree will contain the minimum element, while the rightmost node will contain the maximum element.

Correct AnswerverifiedShow Answer

A binary search tree is a binary tree with the added property that the left child is less than the parent, which is less than or equal to the ___________.

Correct AnswerverifiedShow Answer

The ______ node in a binary search tree will contain the minimum element, while the ______ node will contain the maximum element.

Correct AnswerverifiedShow Answer

The balance restriction on a red/black tree is somewhat less strict than that for AVL trees. However, in both cases, the find operation is order ______.

Correct AnswerverifiedShow Answer

What is the difference between a TreeSet and a TreeMap?

Correct AnswerverifiedBoth are red/black tree implementations ...View AnswerShow Answer

The Java Collections API provides two implementations of balanced binary search trees, ______ and ______, both of which use a red/black tree implementation.

Correct AnswerverifiedShow Answer

Correct Answer
verified
Since no red node can have a red child, ...
View Answer

Correct Answer
verified

Correct Answer
verified

The node in a binary search tree will contain the minimum element, while the node will contain the maximum element.

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
Both are red/black tree implementations ...
View Answer

The Java Collections API provides two implementations of balanced binary search trees, and , both of which use a red/black tree implementation.

Correct Answer
verified