This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: node is split, and there are an odd number of pointers, the new node with the larger number of pointers is to the left of the other. Suppose that we insert a record with key 35 into this tree. Draw the new tree. Solution 70 30 40 95 10 20 30 45 40 50 60 70 80 90 95 97 99 This should be 35 CS143 Midterm, Spring 2006, Section 2 Page: 4 2. Here is another B+tree. 70 80 40 50 10 20 95 97 40 95 70 Assume that each node has room for 3 keys and 4 pointers. Suppose that we delete the record with key 40 from this tree. Draw the new tree. Solution 70 30 40 95 95 99 50 70 80 97 10 20...
View
Full
Document
This note was uploaded on 04/28/2010 for the course CS 143 taught by Professor Zaniolo during the Fall '01 term at UCLA.
 Fall '01
 Zaniolo

Click to edit the document details