Question

When the  in-order traversal is done on a binary tree it yields E A C K F H D B G; its pre-order traversal would return....

a) FAEKCDBHG b) FAEKCDHGB c) EAFKHDCBG d) FEAKDCHBG e) None of these

Comments

Hi  Gopekris9,

Is it possible to get pre-order traversal of a tree if its in-order traversal is given? In the book the dicusssion is mainly on construction of a tree if its two traversals are given(out of which in-order is a must). I would really like to know the way to get pre-order or post-order if in-order is given.I was under assumption that unless preorder traversal is given, it is impossible to know the root node of the BT.

Thanks.

 

Answer 1

Please trees chapters of our book. We have discussed this with code and examples.

Comments

Is it possible to get pre-order traversal of a tree if its in-order traversal is given? In the book the dicusssion is mainly on construction of a tree if its two traversals are given(out of which in-order is a must). I would really like to know the way to get pre-order or post-order if in-order is given.