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.
- Fall '11
- Data Structures