📌Hi Friends ! In this post I am going to explain about B-TREE.What is B-Tree ? How we create B-Tree?A complete procedure about B-Tree by taking an example.
Let we understand What is B-Tree:
B-Tree is a multi way search tree of order 'm' which satisfy the following conditions.
1. All leafs are at same level.
2. All intermediate nodes except the roots can have at most 'm' non-empty children and can have as few as integer value of m/2.
3. Each node of B-tree has one less key than its number of children and key are inserted in a search tree fission.
4. The root of B-Tree can have at most 'm' non-empty children and can have as few as two , if root is alone.
