B -tree link

In a binary search tree ,AVL Tree,/Red -Black tree etc.,every node can have only one value (key) and maximum of two children but there is another type of search tree called B-Tree in which a node can store more than one value

(key) and it can have more than two children.B- Tree was developed in the year of 1972 by Bayer and McCrieght with the name Height Balanced m-way search Tree.Later it was named as B-Tree.B-Tree can be defined as follows…………

1. http://btechsmartclass.com/DS/U5_T3.html
2.   https://www.youtube.com/watch?v=C_q5ccN84C8