cs186_sp08_mt1-6 - intermediate trees are needed for...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Name: __________________________________ B+ Trees (12 pts) This is an initial state of an index represented using a B+ tree. In this tree, under-full nodes are refilled from adjacent nodes if possible, otherwise a merge is done. Draw the B+ tree after the following operations have been completed. (Only the final B+ tree is needed but
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: intermediate trees are needed for partial credit). Also, there is no need to draw the entire tree, you need to only redraw the nodes that are affected (label unchanged nodes with same N x labels used in the picture.) a) Insert record 40* b) Delete record 7* c) Delete record 9* d) Delete record 15* e) Delete record 18* 6...
View Full Document

This note was uploaded on 08/26/2009 for the course CS 186 taught by Professor Staff during the Spring '08 term at University of California, Berkeley.

Ask a homework question - tutors are online