4
$\begingroup$

Is there a way to reconstruct a binary tree just from its in-order representation?

I've searched the internet, but I could only find solutions for reconstructing a binary tree from inorder and preorder representations, but none for only inorder.

Improve this question
$\endgroup$
1
  • 1
    $\begingroup$ See also this question (which doesn't explain why in-order isn't enough on its own). $\endgroup$ Commented Jul 19, 2012 at 8:48

1 Answer 1

Reset to default
6
$\begingroup$

**Example Trees**

The in-order traversal is not unique. The above trees have the same sequence 1,2,3,4,5. (They are isomorphic, but I assumed you consider ordered binary trees.)

Improve this answer
$\endgroup$
0