Adding B-Tree data structure

[Saptashrungi]

Description of the problem

Example of the problem

References/Other comments

https://en.wikipedia.org/wiki/B-tree

[Saptashrungi]

I would like to work on this issue.

[czgdp1807]

How are is B-Tree different from MAryTree?

[Saptashrungi]

B-Tree maintains sorted data and allows searches, sequential access, insertions, and deletions.

[Saptashrungi]

Its a special case of a m-ary tree.

[czgdp1807]

So, we should inherit MAryTree in the class representing B-Tree. Is there any similarity between MArySearchTree and B-Tree?

[Saptashrungi]

There is a similarity. But in case of a B-Tree a condition must hold true. Every node except root must contain at least t-1 keys. Root may contain minimum 1 key. All nodes (including root) may contain at most 2t – 1 keys (where t is degree of B-Tree).

[czgdp1807]

Is there any similarity in the insertion logic of B-Tree and MArySearchTree(described here). If yes then probably MArySearchTree should be added first and then B-Tree.

[Amitsharma45]

@czgdp1807 i want work on this issue

[czgdp1807]

Is there any similarity in the insertion logic of B-Tree and MArySearchTree(described here). If yes then probably MArySearchTree should be added first and then B-Tree.

This should be answered first.