Question

please explain the procedure for B-tree implementation?

Answer 1

Alright, let's see if I remember as much as I think I do from college. A b tree is like a binary tree with an array of nodes instead of a single node. Just implement a linked list of the size of your container instead of a single node in your struct/class, and then rebuild the tree as you process new information. For example, say that I have the numbers 1,2,3,4 in my b tree with a container size of four, and I would like to add 5 to my list. Just take the median number of the five numbers and push everything down to the list on both side of it. So, the parent would be an array holding the value 3. The children connected to the left would be 1,2. The children connected to the right would be 4,5.

Answer 2

go to http://en.wikipedia.org/wiki/B-tree