Expert: Narendra - 12/23/2005

Question
Hi. I'm preparing a university Mini-Project about B-TREES : insertion ,deletion and printing.
Well i've being searching The internet for algorithmes but i only found defintions and pseudo-codes that aren't really helpful. My question is:
- what kind of structure i should use? see i'm confused about the relation between keys and pointers in a node: (n*keys + 1) pointers in a  (n*keys) node .
So please Help Me.
and if u have any documents written in c about the subject or links i would really apreciate that u mail them to me.

Answer
First of all try to understand the data structure first.
Then only get into programming.
And B-Tree is a very popular data structure and it will be part of any data structure book.
Get hold of a good book on data structure or trees or graphs and you must find B-Tree in that.

And your question is not clear to me.
If you can elaborate with an example, I can try to suggest something.