Anonymous

Changes

From CMSC 420
305 bytes added ,  14:24, 7 June 2010
no edit summary
Line 9: Line 9:  
# Each gray node must have at least two children that are black and/or one child that is a valid gray node.
 
# Each gray node must have at least two children that are black and/or one child that is a valid gray node.
 
# If, after a deletion, a gray node has three white children and one black one, the gray node must be deleted and replaced by the black child node.
 
# If, after a deletion, a gray node has three white children and one black one, the gray node must be deleted and replaced by the black child node.
 +
 +
Here is a link to some slides further explaining the PR Quadtree:
 +
[http://courses.cs.vt.edu/~cs3114/Spring10/Notes/T06.PRQuadTrees.pdf PRQuadTrees]
 +
 +
And a lecture concerning its implementation
 +
[http://courses.cs.vt.edu/~cs3114/Spring10/Notes/T07.PRQuadTreeImplementation.pdf PRQuadTrees Implementation]
12

edits