@prateek
but you wont get same tree back always .. you get only balanced tree
take a look below:
9 9
\ \
18 10
/ \ \
10 27 18
\
27
Both are BST but this case inorder traversal wont get back original tree
On Mon, Aug 29, 2011 at 3:09 PM, PRATEEK VERMA <[email protected]> wrote:
> @prashant
> it is the same mid value as u calculate in binary search i.e. (lowest
> index+highest index)/2
> No matter whether it is 18 or 27,u gonna get almost balanced BST every time
> if u do construct the tree as ankit has mentioned.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to [email protected].
> To unsubscribe from this group, send email to
> [email protected].
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Yours affectionately,
Prashant Thorat
Computer Science and Engg. Dept,
NIT Durgapur.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
