Algorithms Problem

In the B^+-tree we consider here, all keys are stored at the leaves, in increasing order of key value. The intermediate nodes are used for indexing. Specifically, each interior node contains m - 1 ordered keys k_1 <... k_m-1 assumed for simplicity to be distinct. the keys are interposed with m pointers node children so that all in subtree smaller than k_1 t_0 greater or equal and k_2 being smallest key t_1 on through last t_m-1 whose t_m-1. a b of order satisfies following structural properties: root is either leaf has between children. each except leaves hence tree balanced i.e. its at same level. figure shows an example state two major differences b-trees compared other bsts. upper bounds height h n nodes is: less use this find minimum guarantees number disk accesses searching file million records does not exceed assume page stored main memory we consider here increasing value. intermediate used indexing. specifically interior contains ordered>