3540quiz6.f06

# 3540quiz6.f06 - 6(True False In a Red-Black tree there is...

This preview shows page 1. Sign up to view the full content.

COP 3540 Fall 2006 Quiz 6 – Red Black Trees Value: 10 Points - 27 November 2006 Name: ________________________ Directions: Put the letter of your choice over the dotted lines accompanying each question’s number. For True / False, put T or F over the dotted lines accompanying each question’s number. Fill-in: obvious. 1. (True, False) Red Black trees are absolutely balanced or at least ‘almost’ balanced. 2-3. The easiest way to arrive at an unbalanced tree to begin with is: 4. (True, False) In a Red Black tree every node is either red or black. 5. (True, False). Every path from root to a leaf (or to a null child ) must contain the same number of black nodes
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 6. (True, False). In a Red-Black tree, there is an equal number of red and black nodes. 7. (True, False) In a Flip operation, the color of the root of the subtree will always change. 8. (True, False). Rotation operations do not necessarily involve the root of the tree. 9……. . Which of the following is NOT a red-black rule? a. every path from a root to a leaf or to a null child must contain the same number of black nodes. b. If a node is black, its children must be red c. The root is always black d. All three are valid rules 10…. . Newly inserted nodes are always colored: a. red b. black c. stripped d. red on outside; black in middle....
View Full Document

## This note was uploaded on 10/04/2011 for the course COP 3540 taught by Professor Bobroggio during the Fall '11 term at University of South Florida.

Ask a homework question - tutors are online