Giving the preorder & inorder lists, How can be constructed the corresponding B-TREE ?

[David Méndez]

Hi,

If I have the preorder and inorder list, which algorithm does I need to
build the corresponding B-TREE? where can I find some source code?

thanks
--
comp.lang.c.mod erated - moderation address: cl**@plethora.n et

[Dave Vandervies]

In article <cl************ ****@plethora.n et>,
David Méndez <da**********@h otmail.com> wrote:

well, I was expecting something like:

typedef struct tree{
int v;
struct tree *left, *right;
}BTREE, *BTREEPTR;

typedef struct list{
int v;
struct list *next
}TLIST, *TLISTPTR;

BTREE *reconstruct_tr ee(TLIST *p, TLIST *i)
{
...
}

I TAKE THE TIME TO IDENT THE CODE THAT YOU SEND ME, What you mean when you
use as parameters another 2 BTREE's ?:
Read the code more carefully.
Note that where the pointers are pointing is more important than what
they're called in determining what data structure they represent.
dave

--
Dave Vandervies dj******@csclub .uwaterloo.ca No, I did not look that up.

You should get out more, then.
--Garrett Wollman and Richard P. Grant in the scary devil monastery
--
comp.lang.c.mod erated - moderation address: cl**@plethora.n et