![Page 1: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/1.jpg)
Data Structures and Algorithms in Java
Chapter 7
Multiway Trees
![Page 2: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/2.jpg)
Data Structures and Algorithms in Java 2
Objectives
Discuss the following topics: • The Family of B-Trees• Tries• Case Study: Spell Checker
![Page 3: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/3.jpg)
Data Structures and Algorithms in Java 3
Multiway Trees
• A multiway search tree of order m, or an m-way search tree, is a multiway tree in which:– Each node has m children and m – 1 keys– The keys in each node are in ascending order– The keys in the first i children are smaller than
the ith key– The keys in the last m – i children are larger than
the ith key
![Page 4: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/4.jpg)
Data Structures and Algorithms in Java 4
Multiway Trees (continued)
Figure 7-1 A 4-way tree
![Page 5: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/5.jpg)
Data Structures and Algorithms in Java 5
The Family of B-Trees
access time = seek time + rotational delay (latency) + transfer time
• Seek time depends on the mechanical movement of the disk head to position the head at the correct track of the disk
• Latency is the time required to position the head above the correct block and is equal to the time needed to make one-half of a revolution
![Page 6: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/6.jpg)
Data Structures and Algorithms in Java 6
The Family of B-Trees (continued)
Figure 7-2 Nodes of a binary tree can be located in different blocks on a disk
![Page 7: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/7.jpg)
Data Structures and Algorithms in Java 7
B-Trees
Figure 7-3 One node of a B-tree of order 7 (a) without and (b) with an additional indirection
![Page 8: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/8.jpg)
Data Structures and Algorithms in Java 8
B-Trees (continued)
Figure 7-4 A B-tree of order 5 shown in an abbreviated form
![Page 9: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/9.jpg)
Data Structures and Algorithms in Java 9
Inserting a Key into a B-Tree
• There are three common situations encountered when inserting a key into a B-tree:– A key is placed in a leaf that still has
some room– The leaf in which a key should be
placed is full– If the root of the B-tree is full then a new
root and a new sibling of the existing root have to be created
![Page 10: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/10.jpg)
Data Structures and Algorithms in Java 10
Inserting a Key into a B-Tree (continued)
Figure 7-5 A B-tree (a) before and (b) after insertion of the number 7 into a leaf that has available cells
![Page 11: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/11.jpg)
Data Structures and Algorithms in Java 11
Inserting a Key into a B-Tree (continued)
Figure 7-6 Inserting the number 6 into a full leaf
![Page 12: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/12.jpg)
Data Structures and Algorithms in Java 12
Inserting a Key into a B-Tree (continued)
Figure 7-7 Inserting the number 13 into a full leaf
![Page 13: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/13.jpg)
Data Structures and Algorithms in Java 13
Inserting a Key into a B-Tree (continued)
Figure 7-7 Inserting the number 13 into a full leaf (continued)
![Page 14: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/14.jpg)
Data Structures and Algorithms in Java 14
Inserting a Key into a B-Tree (continued)
Figure 7-8 Building a B-tree of order 5 with the BTreeInsert() algorithm
![Page 15: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/15.jpg)
Data Structures and Algorithms in Java 15
Inserting a Key into a B-Tree (continued)
Figure 7-8 Building a B-tree of order 5 with the BTreeInsert() algorithm(continued)
![Page 16: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/16.jpg)
Data Structures and Algorithms in Java 16
Inserting a Key into a B-Tree (continued)
Figure 7-8 Building a B-tree of order 5 with the BTreeInsert() algorithm(continued)
![Page 17: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/17.jpg)
Data Structures and Algorithms in Java 17
Deleting a Key from a B-Tree
• Avoid allowing any node to be less than half full after a deletion
• In deletion, there are two main cases: – Deleting a key from a leaf – Deleting a key from a nonleaf node
![Page 18: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/18.jpg)
Data Structures and Algorithms in Java 18
Deleting a Key from a B-Tree (continued)
Figure 7-9 Deleting keys from a B-tree
![Page 19: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/19.jpg)
Data Structures and Algorithms in Java 19
Deleting a Key from a B-Tree (continued)
Figure 7-9 Deleting keys from a B-tree (continued)
![Page 20: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/20.jpg)
Data Structures and Algorithms in Java 20
Deleting a Key from a B-Tree (continued)
Figure 7-9 Deleting keys from a B-tree (continued)
![Page 21: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/21.jpg)
Data Structures and Algorithms in Java 21
B*-Trees
• In a B*-tree, all nodes except the root are required to be at least two-thirds full, not just half full as in a B-tree
• The frequency of node splitting is decreased by delaying a split, and by splitting two nodes into three not one into two
• The average utilization of B*-tree is 81 percent
![Page 22: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/22.jpg)
Data Structures and Algorithms in Java 22
B*-Trees (continued)
Figure 7-10 Overflow in a B*-tree is circumvented by redistributing keys between an overflowing node and its sibling
![Page 23: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/23.jpg)
Data Structures and Algorithms in Java 23
B*-Trees (continued)
Figure 7-11 If a node and its sibling are both full in a B*-tree, a split occurs: A new node is created and keys are distributed between three nodes
![Page 24: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/24.jpg)
Data Structures and Algorithms in Java 24
B+-Trees
• References to data are made only from the leaves
• The internal nodes of a B+-tree are indexes for fast access of data; this part of the tree is called an index set
• The leaves are usually linked sequentially to form a sequence set so that scanning this list of leaves results in data given in ascending order
![Page 25: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/25.jpg)
Data Structures and Algorithms in Java 25
B+-Trees (continued)
Figure 7-12 An example of a B+-tree of order 4
![Page 26: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/26.jpg)
Data Structures and Algorithms in Java 26
B+-Trees (continued)
Figure 7-13 An attempt to insert the number 6 into the first leaf of a B+-tree
![Page 27: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/27.jpg)
Data Structures and Algorithms in Java 27
B+-Trees (continued)
Figure 7-14 Actions after deleting the number 6 from the B+-tree in Figure 7.13b
![Page 28: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/28.jpg)
Data Structures and Algorithms in Java 28
Prefix B+-Trees
• A simple prefix B+-tree is a B+-tree in which the chosen separators are the shortest prefixes that allow us to distinguish two neighboring index keys
• After a split, the first key from the new node is neither moved nor copied to the parent
• The shortest prefix is found that differentiates it from the prefix of the last key in the old node; and the shortest prefix is then placed in the parent
![Page 29: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/29.jpg)
Data Structures and Algorithms in Java 29
Prefix B+-Trees (continued)
Figure 7-15 A B+-tree from Figure 7.12 presented as a simple prefix B+-tree
![Page 30: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/30.jpg)
Data Structures and Algorithms in Java 30
Prefix B+-Trees (continued)
Figure 7-16 (a) A simple prefix B+-tree and (b) its abbreviated version presented as a prefix B+-tree
![Page 31: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/31.jpg)
Data Structures and Algorithms in Java 31
Prefix B+-Trees (continued)
Figure 7-16 (a) A simple prefix B+-tree and (b) its abbreviated version presented as a prefix B+-tree (continued)
![Page 32: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/32.jpg)
Data Structures and Algorithms in Java 32
Bit-Trees
• Based on the concept of a distinction bit (D-bit)• A distinction bit D(K,L) is the number of the most
significant bit that differs in two keys, K and L, and D(K,L) = key-length-in-bits – 1 – [lg(K xor L)]
• A bit-tree uses D-bits to separate keys in the leaves only; the remaining part of the tree is a prefix B+-tree
• The actual keys and entire records from which these keys are extracted are stored in a data file
![Page 33: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/33.jpg)
Data Structures and Algorithms in Java 33
Bit-Trees (continued)
Figure 7-17 A leaf of a bit-tree
![Page 34: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/34.jpg)
Data Structures and Algorithms in Java 34
R-Trees
Figure 7-18 An area X on the Cartesian plane enclosed tightly by the rectangle ([10,100], [5,52]). The rectangle parameters and the area identifier are stored in a leaf of an R-tree.
![Page 35: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/35.jpg)
Data Structures and Algorithms in Java 35
R-Trees (continued)
Figure 7-19 Building an R-tree
![Page 36: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/36.jpg)
Data Structures and Algorithms in Java 36
R-Trees (continued)
Figure 7-19 Building an R-tree (continued)
![Page 37: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/37.jpg)
Data Structures and Algorithms in Java 37
R-Trees (continued)
Figure 7-20 An R+-tree representation of the R-tree in Figure 7.19d after inserting the rectangle R9 in the tree in Figure 7.19c
![Page 38: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/38.jpg)
Data Structures and Algorithms in Java 38
2–4 Trees
• In 2–4 trees, only one, two, or at most three elements can be stored in one node
• To represent a 2–4 tree as a binary tree, two types of links between nodes are used:– One type indicates links between nodes
representing keys belonging to the same node of a 2–4 tree
– Another represents regular parent–children links
![Page 39: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/39.jpg)
Data Structures and Algorithms in Java 39
2–4 Trees (continued)
Figure 7-21 (a) A 3-node represented (b–c) in two possible ways by red-black trees and (d–e) in two possible ways by vh-trees. (f) A 4-node represented (g) by a red-black tree and (h) by a vh-tree.
![Page 40: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/40.jpg)
Data Structures and Algorithms in Java 40
2–4 Trees (continued)
Figure 7-22 (a) A 2–4 tree represented (b) by a red-black tree and (c) by a binary tree with horizontal and vertical pointers
![Page 41: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/41.jpg)
Data Structures and Algorithms in Java 41
2–4 Trees (continued)
Figure 7-23 (a) A vh-tree of height 7; (b) a vh-tree of height 8
![Page 42: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/42.jpg)
Data Structures and Algorithms in Java 42
2–4 Trees (continued)
Figure 7-24 (a–b) Split of a 4-node attached to a node with one key in a 2–4 tree. (c–d) The same split in a vh-tree equivalent to these two nodes.
![Page 43: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/43.jpg)
Data Structures and Algorithms in Java 43
2–4 Trees (continued)
Figure 7-25 (a–b) Split of a 4-node attached to a 3-node in a 2–4 tree and (c–d) a similar operation performed on one possible vh-tree equivalent to these two nodes.
![Page 44: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/44.jpg)
Data Structures and Algorithms in Java 44
2–4 Trees (continued)
Figure 7-26 Fixing a vh-tree that has consecutive horizontal links
![Page 45: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/45.jpg)
Data Structures and Algorithms in Java 45
2–4 Trees (continued)
Figure 7-27 A 4-node attached to a 3-node in a 2–4 tree
![Page 46: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/46.jpg)
Data Structures and Algorithms in Java 46
2–4 Trees (continued)
Figure 7-28 Building a vh-tree by inserting numbers in this sequence: 10, 11, 12, 13, 4, 5, 8, 9, 6, 14
![Page 47: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/47.jpg)
Data Structures and Algorithms in Java 47
2–4 Trees (continued)
Figure 7-29 Deleting a node from a vh-tree
![Page 48: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/48.jpg)
Data Structures and Algorithms in Java 48
2–4 Trees (continued)
Figure 7-29 Deleting a node from a vh-tree
![Page 49: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/49.jpg)
Data Structures and Algorithms in Java 49
2–4 Trees (continued)
Figure 7-29 Deleting a node from a vh-tree (continued)
![Page 50: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/50.jpg)
Data Structures and Algorithms in Java 50
2–4 Trees (continued)
Figure 7-29 Deleting a node from a vh-tree (continued)
![Page 51: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/51.jpg)
Data Structures and Algorithms in Java 51
2–4 Trees (continued)
Figure 7-29 Deleting a node from a vh-tree (continued)
![Page 52: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/52.jpg)
Data Structures and Algorithms in Java 52
2–4 Trees (continued)
Figure 7-29 Deleting a node from a vh-tree (continued)
![Page 53: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/53.jpg)
Data Structures and Algorithms in Java 53
2–4 Trees (continued)
Figure 7-30 Examples of node deletions from a vh-tree
![Page 54: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/54.jpg)
Data Structures and Algorithms in Java 54
2–4 Trees (continued)
Figure 7-30 Examples of node deletions from a vh-tree (continued)
![Page 55: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/55.jpg)
Data Structures and Algorithms in Java 55
2–4 Trees (continued)
Figure 7-30 Examples of node deletions from a vh-tree (continued)
![Page 56: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/56.jpg)
Data Structures and Algorithms in Java 56
2–4 Trees (continued)
Figure 7-30 Examples of node deletions from a vh-tree (continued)
![Page 57: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/57.jpg)
Data Structures and Algorithms in Java 57
2–4 Trees (continued)
Figure 7-30 Examples of node deletions from a vh-tree (continued)
![Page 58: Chapter 7 Multiway Trees - Radford Universitymhtay/ITEC360/webpage/Lecture/07_p1.pdf · 2006-01-07 · an index set • The leaves are usually linked sequentially to form a sequence](https://reader031.vdocuments.us/reader031/viewer/2022020303/5b324e927f8b9a2c328d4edd/html5/thumbnails/58.jpg)
Data Structures and Algorithms in Java 58
2–4 Trees (continued)
Figure 7-31 An example of converting (a) an AVL tree into (b) an equivalent vh-tree