I am looking for a simple B+ tree implementation in C++. Please do not
point me to  exisiting libraries like GIST or point me to "B" tree
implementations. I need a "B+".

---

Request for Question Clarification by efn-ga on 09 Jul 2006 15:25 PDT

Will the one on this page meet your needs?

http://en.wikibooks.org/wiki/Transwiki:B%2B_tree

---

Clarification of Question by woburnsa-ga on 09 Jul 2006 22:22 PDT

Nope! 

I need API for..
a) Search(key)
b) Search(key1,keyn) ==> List all pointers from Key1 to Keyn
c) Inset (element)
d) Print Tree
e) Delete Entry

Hi, 
   It is really a good one. I searched on the internet but nothing
meaningful can be found. Can u clarify ur all requirements. May be I
can take out some time to write code 4 u.
Thnx..

Try http://www.cs.duke.edu/TPIE/. You have to download tgz file
labelled "Download latest TPIE CVS snapshot" in the web page. Extract
the archive using your favorite zip utility & then search for
ami_btree.h file or it will be under <tpie_root_dir>/include
directory.

It has a B+tree implementation & it is a templatized C++ source code
written very well. It has all the functionalities you are expecting
i.e. search, range search (search for keys from within a range),
insert, delete keys etc.

Hope this will help you. Good luck for your work.

Regards
RKK