Can any one tell briefly about B+ tree. I searched. But their is no
detailed explanation.
If any one have that, pls post!

lak <lakindia89@gmail.com> writes:

>Can any one tell briefly about B+ tree. I searched. But their is no
>detailed explanation.

I do not believe you. I think that you are lazy:

http://www.google.com/search?client=...UTF-8&oe=UTF-8

Brief != detailed.

--
Chris.

On 7 May 2008 at 8:34, lak wrote:
> Can any one tell briefly about B+ tree. I searched. But their is no
> detailed explanation.

There's a good overview on Wikipedia, of course:
http://en.wikipedia.org/wiki/B%2B_tree

There are some "external links" at the bottom of the page, some of which
might be useful.

These newsgroups are generally better for specific questions, rather
than asking for explanations of a broad subject: text books are usually
the right place to look for that.

On May 7, 1:34am, lak <lakindi...@gmail.com> wrote:
> Can any one tell briefly about B+ tree. I searched. But their is no
> detailed explanation.

It is like an ordinary binary tree, except that the leaves are stuffed
into clumps. The idea is that when you read a clump into memory, it
is likely that the nearby leaf you are looking for is already in
memory and it will save time.

P.S.
Your post has nothing to do with the C language as far as I can see.
Your post is more topical in news:comp.programming. Ben Pfaff posts
over there, and he is a tree guru if there ever was one.

P.P.S
Follow-ups set to news:comp.programming