2-3-4 Trees and Red/Black Trees

More documents

Recommendations

Info

fixTree Cases1.RecolorGGGPUPUNP G UN PUNcNcabab2.RecolorPGUPGUP N G UP NGUaNaN3.RecolorRootbcRbRcNote: For insertion/removalalgorithm we consider nonexistentleaf nodes as blacknodes© Copyright 2013 Brent Nash & Mark <strong>Red</strong>ekopp, All Rights Reserved50
fixTree Cases4.1 Rotate /RecolorNPGcURightrotate of PaNbPcGUP GN ca bUaN P GbcUab5.2 Rotates /RecolorPGULeft rotateof PNGURightrotate of G& RecolorPNGaNPcabcUbcabP GP N GaNUa b cUb c© Copyright 2013 Brent Nash & Mark <strong>Red</strong>ekopp, All Rights Reservedwww.cse.ohio-state.edu/~gurari/course/cis680Ch11.html51
Page 2: Definition‣ 2-3-4 trees are very
Page 5 and 6: 2-3-4 Insertion Algorithm‣ Key: R
Page 7 and 8: 2-3-4 Insertion Algorithm‣ Key: S
Page 9 and 10: 2-3-4 Insertion Exercise 2Add 5820
Page 11 and 12: 2-3-4 Insertion Exercise 3Resulting
Page 13 and 14: TREE ROTATIONS© Copyright 2013 Bre
Page 15 and 16: BST Subtree Ranges‣ Consider a bi
Page 17 and 18: Right Rotation‣ Define a right ro
Page 19 and 20: Left Rotation‣ Define a left rota
Page 21 and 22: Rotation's Effect on Height‣ When
Page 23 and 24: Red Black Trees‣ A red-black tree
Page 25 and 26: Red-Black Tree Properties‣ Valid
Page 27 and 28: fixTree Cases1.RecolorGGGPUPUNP G U
Page 29 and 30: Insertion‣ Insert 10, 20, 30, 15,
Page 31 and 32: ‣ Insert 10, 20, 30, 15, 25, 12,
Page 33 and 34: Insertion Exercise 1Insert 271253 1
Page 35 and 36: Insertion Exercise 2Insert 401253 1
Page 37 and 38: Insertion Exercise 2A1253 10G1520P2
Page 39 and 40: Insertion Exercise 3Insert 50121252
Page 41 and 42: Insertion Exercise 4Insert 45121252
Page 43 and 44: Final Result125273 1020408152530504
Page 45 and 46: Insertion Exercise 5125273 92040810
Page 47 and 48: ‣ Implement private methods:- fin
Page 49: FOR PRINT© Copyright 2013 Brent Na

2-3-4 Trees and Red/Black Trees

Create successful ePaper yourself

Delete template?

Save as template?