hw4 - HOMEWORK#4 B trees CS 308 Spring 2011 Prof Frankl Due...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Sheet1 Page 1 HOMEWORK #4: B+ trees CS 308 Spring 2011 Prof Frankl Due Tuesday Feb 19, 2011 @ 9:30 a.m. Hand in electronically on MyPoly. For the insertion/deletion problems you may either draw the trees or describe them textually , Please highlight the changes (or only describe/show the changes) to make it easier for the grader to check your work. Consider the following B+ tree. The structure is described first, followed by the key values in each node. n = 8. (Therefore internal nodes other than the root must have between 4 and 8 children and leaves must have between 4 and Structure: n = 8 A has two children: B and C. B has four children: D, E, F, G. C has eight children: H, I, J, K, L, M, N, O. Key values: A: 40 B: 10, 18, 32 C: 50, 60, 74, 82, 100, 120, 140 D: 2, 4, 6, 8 E: 10, 12, 14, 16 F: 18, 20, 22, 24, 26, 28, 30 G: 32, 34, 36, 38 H: 40, 42, 44, 46, 48 I: 50, 52, 54, 56, 58 J: 60, 62, 64, 66, 68, 70, 72 K: 74, 76, 78, 80 L: 82, 84, 86, 88 M, N, O: details not needed for this problem (< on left, >= on right) ------------------------------------------------------------------------ What nodes are visited and, in each what key comparisons are made, when doing each of the following searches: find record with key value 66 66>=40, so go to C Go to the pointer to the right of 66, since 66>=66
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/10/2011 for the course CS 308 taught by Professor Frankl during the Spring '11 term at NYU Poly.

Page1 / 4

hw4 - HOMEWORK#4 B trees CS 308 Spring 2011 Prof Frankl Due...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online