UNIX for Advanced & Expert Users

Hi all
I understood the concept of Btree( Balanced tree). one thing i just want to know whether key and values are different or both are same.
If it is different, kindly please explain me the concept because i am on my way to implement it\

Thanks

The ones I've written use a key with a pointer to an array of objects where the actual data lives.

So: No, keys and data are not the same. Besides which, the key could be concatenated values from different parts of the record, where the record is a struct, for example.

The object of a btree is to get fast access to the data, kind of like what databases do when they contruct btree indexes. Storing the data in the btree is not a good general solution, IMO.

As with most things, how to build it depends what you want to do with it. btree structures meant to be stored on disk might look rather different from ones meant to operate purely in memory for example.