The unique one
Given the following pairs of traversal of a binary tree:
A) inorder and postorder
B) Preorder and inorder
C) preorder and postorder
D) level order and postorder
Which of the following pairs uniquely defines a tree?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
Given a tree with distinct elements, either pre-order or post-order paired with in-order is sufficient to describe the tree uniquely.(Wiki)