In article
<7195ae93-878a-4df9-9fff-4856b5af1c6b@[EMAIL PROTECTED]
>,
sophia <sophia.agnes@[EMAIL PROTECTED]
> wrote:
>Is it possible to re create a binary tree from given preorder and post
>order traversals ?
Yes.
Look for,
"An optimal parallel algorithm to reconstruct a binary tree from its
traversals" by Stephan Olariu, Michael Overstreet and Zhaofang Wen
--
"Let me live in my house by the side of the road --
It's here the race of men go by.
They are good, they are bad, they are weak, they are strong
Wise, foolish -- so am I;" -- Sam Walter Foss
|
