Re: saving binary tree to file

[Ketan Mehta <ketan.mehta@xxxxxxxxx>]

hi,

>  oops ! must have got the name wrong i meant "breadth first search order"
> i.e root,left,right.

	In-order traversal is root , left , right.

	BFS - has to be implemented by queue only.. ( ur algo for root, left ,
right - asuming 
			recursive calls... left will again call same algo and visit root
and 				left.. till NULL... so do say how u want to do)..

	if u have pre-order or in-order ( infact any 2 ordered list then u can
construct
the b-tree as it is.. very complex proof.. see some data struct book. -
knuth/...)

	bye
ketan

-- 
|------------------------------------------------------------|
|It is better to keep your mouth shut and be thought a fool, |
|            than to open it and remove all doubt.	     |
|------------------------------------------------------------|
|Ketan Mehta | Wipro | Bangalore | Ph 91-80-5722296/93-5240  |
|ketan.mehta@xxxxxxxxx | ketan_kmehta@xxxxxxxxxxxx (personal)|
|------------------------------------------------------------|