From in-order representation to binary tree

Question

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.

score 6 · Answer 1 · edited Jul 19 '12 at 21:10

6

**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.)

edited Jul 19 '12 at 21:10

Raphael

73,212
30
182
400

answered Jul 18 '12 at 20:29

A.Schulz

12,252
1
42
64

From in-order representation to binary tree

1 Answers1

Linked