Chapter 13
Multiway Trees and B Trees
This chapter is dedicated to the discussion of multiway trees and B trees. The structure of a node in m-way trees and operations on them are explained in detail. Stating the drawbacks of m-way search trees, the need for B trees is explained along with its definition. Regarding B trees operation performed on them and its height are discussed. This also includes variations of B trees and database as an application of B trees.
13.1 INTRODUCTION
The tree data structures in which a node has more than two branches are termed as multiway trees. Data structures m-way search trees and B trees come under this category. In some applications like Database very large index entries may be found. Such index can be maintained ...
Get Data Structures and Algorithms Using C++ now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
