Show the result of inserting 28, 12, 17, 4, 31, 34, 8, 14 & 16 in that order int

Question

Show the result of inserting 28, 12, 17, 4, 31, 34, 8, 14 & 16 in that order into an initially empty B tree with M = 3 and L = 2. (Recall the text, lecture, and this problem call a B tree what many call a B+ tree.)Show the tree after each insertion, clearly labeling which tree is which. In an actual implementation, there is flexibility in how insertion overflow is handled. However, in this problem, follow these three guidelines: Always use splitting (not adoption). Split leaf nodes by keeping the smallest 2 elements in the original node and putting the 1 largest element in the new node. Split internal nodes by keeping the 2 children with the smaller values attached to the original node and attach the 2 children with the larger values to the new node.

Explanation / Answer

J =E

E = J = 1.5E-6*2.3/(pi*(.42E-3)^2)=6.225 to the left

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.