Question Details

No question body available.

Tags

algorithm binary-tree

Answers (1)

Accepted Answer Available
Accepted Answer
April 11, 2025 Score: 9 Rep: 2,301 Quality: High Completeness: 40%

Short answer is NO, unless it is also a full binary tree.

The reason is without inorder traversal you won't be able to resolve the ambiguity of left/right, for instance, the two binary trees below give you the same pre/postorder traversal:

  1                   1
 / \                 / \
2   5       vs      2   5
\   /              /   /
 3 6              3   6