chapter 12 advanced data structures - william & marytadavis/cs303/ch12sf.pdf · chapter 12...
TRANSCRIPT
![Page 1: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/1.jpg)
Chapter 12
Advanced Data Structures
![Page 2: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/2.jpg)
Red-Black Trees
2
−add the attribute of _________ (red or black) to links/nodes
− red-black trees used in
−C++ Standard Template Library (STL)
−Java to implement maps (or _________________, as in
Python)
![Page 3: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/3.jpg)
Red-Black Trees
3
−a red-black tree is a ______ with the following properties:
−every node is either red or black
− the root is __________
− if a node is red, its children must be _________
−every path from the root to a null link contains the same
number of black nodes
−perfect black ___________
− the height of an 𝑁-node red-black BST is at most
2 lg (𝑁 + 1), so
−search, insertion, and deletion are lg 𝑁 operations
![Page 4: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/4.jpg)
Red-Black Trees
4
−building a red-black tree
− in order to maintain perfect black balance, any new node
added to the tree must be ______
− if the parent of the new node is _________, all is well
− if the parent of the new node is ______, this violates the
condition that red nodes have only black children
−fix with ___________ similar to those for AVL and splay
trees
−can be used to maintain the red-black structure at any
point in the tree, not just at insertion of a new node
![Page 5: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/5.jpg)
Red-Black Trees
5
− top-down insertion: color flips
− to preserve perfect black balance, a newly inserted node
must be red
− in top-down insertion, we change the tree as we move
down the tree to the point of ______________
−the changes we make insure that when we insert the
new node, the parent is _________
− if we encounter a node X with two red children, we
make X red and its children black
−if X is the root, we change the color back to black
−a color flip can cause a red-black violation (a red child
with a red parent) only if X’s parent P is ______
![Page 6: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/6.jpg)
Red-Black Trees
6
− red-black tree rotations
−case 1: the ___________ is red and the parent’s sibling is
black (or missing)
− this is a _________ rotation and a color swap for P and G
![Page 7: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/7.jpg)
Red-Black Trees
7
− red-black tree rotations
−case 2: the parent is red and the parent’s sibling is black
(or missing)
− this is a _________ rotation and a color swap for X and G
![Page 8: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/8.jpg)
Red-Black Trees
8
− red-black tree rotations
− the parent is red and the parent’s sibling is ______
−this can’t happen since it would mean that the parent
and its sibling are both red
−we changed all such pairs to _________ on the way
down
![Page 9: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/9.jpg)
Red-Black Trees
9
−example: GOTCHA
![Page 10: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/10.jpg)
Red-Black Trees
10
−example: GOTCHA (cont.)
![Page 11: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/11.jpg)
Red-Black Trees
11
−example: GOTCHA (cont.)
![Page 12: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/12.jpg)
Red-Black Trees
12
−example: GOTCHA (cont.)
− the standard ______ (rightmost) for GOTCHA is slightly shorter
![Page 13: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/13.jpg)
Red-Black Trees
13
−example: ISOGRAM
![Page 14: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/14.jpg)
Red-Black Trees
14
−example: ISOGRAM (cont.)
![Page 15: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/15.jpg)
Red-Black Trees
15
−example: ISOGRAM (cont.)
![Page 16: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/16.jpg)
Red-Black Trees
16
−example: ISOGRAM (cont.)
![Page 17: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/17.jpg)
Red-Black Trees
17
−example: ISOGRAM (cont.)
![Page 18: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/18.jpg)
−2-3-4 trees
−useful because we can insert new items while maintaining
___________ balance
−a 2-3-4 tree consists of
−2-nodes: one key, ______ children
−3-nodes: two keys, __________ children
−4-nodes: three keys, ________ children
2-3-4 Trees
18
![Page 19: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/19.jpg)
2-3-4 Trees
19
− insertion into 2-3-4 trees
− insert the new key into the ___________ existing node
reached in the search
![Page 20: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/20.jpg)
2-3-4 Trees
20
−what about a 4-node?
− top-down insertion
−as we move down the tree, whenever we encounter a
4-node, we move the __________ element up into the
parent node and break up the remainder into _______
2-nodes
![Page 21: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/21.jpg)
2-3-4 Trees
21
−what about a 4-node?
− top-down insertion (cont.)
− insertion, if done here, now reduces to the case of a
__________ or ___________
![Page 22: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/22.jpg)
2-3-4 Trees
22
− top-down insertion
−as we move down the tree, we split up 4-nodes as we
encounter them through the following process
−move the middle key up to the parent
−split the remaining keys into 2-nodes
− this action ______________ that the parent of any 4-node
we encounter is a 2-node or 3-node
−therefore, the tree will always have room to accept the
___________ element of the 4-node
![Page 23: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/23.jpg)
2-3-4 Trees
23
−example: insert 42, 9, 39, 11, 27, 13, 33, 16, 28
− the first three insertions are straightforward
−when inserting 11, we encounter a 4-node, which we ______
−39 is first promoted as a new root node
−perfect balance is maintained in 2-3-4 trees by growing at
the ________
![Page 24: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/24.jpg)
2-3-4 Trees
24
−example: insert 42, 9, 39, 11, 27, 13, 33, 16, 28 (cont.)
− insert 27
− insert 13: first split 4-node
![Page 25: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/25.jpg)
2-3-4 Trees
25
−example: insert 42, 9, 39, 11, 27, 13, 33, 16, 28 (cont.)
− insert 33
− insert 16: split 4-node
![Page 26: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/26.jpg)
2-3-4 Trees
26
−example: insert 42, 9, 39, 11, 27, 13, 33, 16, 28 (cont.)
− insert 28: split 4-node at root
−once again, ___________ at the root maintains perfect
balance
![Page 27: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/27.jpg)
2-3-4 Trees
27
−complexity of 2-3-4 tree operations
− the height of an 𝑁-node 2-3-4 tree is between log4 𝑁 =
1
2lg 𝑁 and lg 𝑁
−searching and inserting are both lg 𝑁 operations
− rather than splitting 4-nodes on the way down, we could
also perform _______________ insertion, starting at the
insertion node and moving upwards
−deletion involves ___________ nodes (and is also lg 𝑁)
![Page 28: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/28.jpg)
2-3-4 Trees as Red-Black Trees
28
− red-black trees are a way of realizing 2-3-4 trees as binary
search trees
−allows us to re-use an implementation of a BST, and
simplifies _______________
−add the attribute of ________ (red or black) to links/nodes
![Page 29: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/29.jpg)
2-3-4 Trees as Red-Black Trees
29
−encoding 2-3-4 trees as red-black trees
![Page 30: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/30.jpg)
2-3-4 Trees as Red-Black Trees
30
−encoding 2-3-4 trees as red-black trees
![Page 31: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/31.jpg)
2-3-4 Trees as Red-Black Trees
31
−a red-black tree is a BST with the following properties:
−every node is either red or black
− the root is black
− if a node is red, its children must be black
−every path from the root to a null link contains the same
number of black nodes
− in the encoding of 2-3-4 trees from red-black trees, the _____
links in the red-black tree correspond to the links in the 2-3-4
tree, while the ____ links denote a split of a 2-node or 3-node
−condition 4 corresponds to the perfect balance of 2-3-4 trees
− the height of an 𝑁-node red-black BST is at most 2 lg (𝑁 + 1),
so search, insertion, and deletion are lg 𝑁 operations
![Page 32: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/32.jpg)
2-3-4 Trees as Red-Black Trees
32
−building a red-black tree
− in order to maintain perfect black balance, any new node
added to the tree must be red
− if the parent of the new node is black, all is well
− if the parent of the new node is red, this violates the
condition that red nodes have only black children
−fix with rotations similar to those for AVL and splay trees
−can be used to maintain the red-black structure at any
point in the tree, not just at insertion of a new node
![Page 33: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/33.jpg)
2-3-4 Trees as Red-Black Trees
33
− top-down insertion: color flips
−we will follow a top-down insertion scheme as we did with
2-3-4 trees
−as we move down the tree to insert a node, if we
encounter a node X with two red children, we make X red
and its children black
− if X is the root, we change the color back to black
−a color flip can cause a red-black violation (a red child with
a red parent) only if X’s parent P is red
![Page 34: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/34.jpg)
2-3-4 Trees as Red-Black Trees
34
−color flips correspond to splitting 4-nodes
![Page 35: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/35.jpg)
2-3-4 Trees as Red-Black Trees
35
− red-black tree rotations
−case 1: the parent is red and the parent’s sibling is black
(or missing)
− this is a single rotation and a color swap for P and G
![Page 36: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/36.jpg)
2-3-4 Trees as Red-Black Trees
36
−color flips correspond to splitting 4-nodes
![Page 37: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/37.jpg)
2-3-4 Trees as Red-Black Trees
37
− red-black tree rotations
−case 2: the parent is red and the parent’s sibling is black
(or missing)
− this is a double rotation and a color swap for X and G
![Page 38: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/38.jpg)
2-3-4 Trees as Red-Black Trees
38
−color flips correspond to splitting 4-nodes
![Page 39: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/39.jpg)
2-3-4 Trees as Red-Black Trees
39
− red-black tree rotations
− the parent is red and the parent’s sibling is red
−this can’t happen since it would mean that the parent
and its sibling are part of a ____________
−we split all the 4-nodes we encountered on the way
down
![Page 40: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/40.jpg)
2-3-4 Trees as Red-Black Trees
40
−example: GOTCHA
![Page 41: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/41.jpg)
2-3-4 Trees as Red-Black Trees
41
−example: GOTCHA (cont.)
![Page 42: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/42.jpg)
2-3-4 Trees as Red-Black Trees
42
−example: GOTCHA (cont.)
![Page 43: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/43.jpg)
2-3-4 Trees as Red-Black Trees
43
−example: GOTCHA (cont.)
− the standard BST (rightmost) for GOTCHA is slightly shorter
![Page 44: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/44.jpg)
2-3-4 Trees as Red-Black Trees
44
−example: ISOGRAM
![Page 45: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/45.jpg)
2-3-4 Trees as Red-Black Trees
45
−example: ISOGRAM
![Page 46: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/46.jpg)
2-3-4 Trees as Red-Black Trees
46
−example: ISOGRAM
![Page 47: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/47.jpg)
2-3-4 Trees as Red-Black Trees
47
−example: ISOGRAM
![Page 48: Chapter 12 Advanced Data Structures - William & Marytadavis/cs303/ch12sf.pdf · Chapter 12 Advanced Data Structures . ... −split the remaining keys into 2-nodes ... insertion node](https://reader031.vdocuments.site/reader031/viewer/2022021817/5a84ddcc7f8b9a14748bb07b/html5/thumbnails/48.jpg)
2-3-4 Trees as Red-Black Trees
48
−example: ISOGRAM