Re: Generic B-tree implementation

From: Vishal Patil
Date: Tue Jul 18 2006 - 09:28:52 EST


I said B-Tree and not binary tree, please read the explaination about
B-tree at Also I am aware of AVL

I never claimed that my implementation is better or anything like
that. I posted the code so that someone in need of the data structure
might use it. Also I would be willing them to help with their project.

- Vishal

On 7/18/06, Gary Funck <gary@xxxxxxxxxxxx> wrote:

Vishal Patil wrote:
> I am attaching source files containing a very generic implementation
> of B-trees in C. The implementation corresponds to in memory B-Tree
> data structure. The B-tree library consists of two files, btree.h and
> btree.c. I am also attaching a sample program main.c which should
> hopefully make the use of the library clear.

Couple of thoughts:

1. red/black b-trees have superior worst case performance as it
relates to rebalancing, and the implementation doesn't add a
lot of complexity:

2. Paul Vixie's b-tree implementation has been around since the mid-80's
or so, and simply from an historical perspective is worth a look
(comp.sources.unix anyone?):

3. GCC uses 'splay trees' to good advantage:
which have the property that most-recently referenced nodes
tend to be higher up in the tree.

Motivation will almost always beat mere talent.
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at
Please read the FAQ at