Lecture 10
B-Trees And Heaps (Sections 11.4, 8.4)


In this lecture we will look at two kinds of balanced trees, B-trees and Heaps.

B-trees are extremely widely used in practice for storing large amounts of data on disk. A B-tree is perfectly height-balanced version of a data structure called an M-way search tree, so we will begin by discussing M-way search trees.