CS 330
Lecture 19
B+ Trees
Reading: textbook, Ch. 11.3, page 346.
- Review: binary search trees. Good properties: balanced. Allowing
insertions and deletions.
- Generalizations: k-ary trees (more children per node).
- B-trees as generalizations of binary search trees. Balance property:
number of children between k/2 and k.
- B+ trees. Insertions. Examples.
- When to use indexing. What types of queries benefit from it.
Homework (not graded): perform the following sequence of insertions in an
empty B+ tree (2-3 tree). Show the tree after each insertion.
w,n,m,v,h,o,d,e,p,b,y,l,a,q,g,r,c,k,f,x,i,s,j,t,u.
Ileana Streinu