18 votes 18 votes Construct a binary tree whose preorder traversal is $K\;L\;N\;M\;P\;R\;Q\;S\;T$ and inorder traversal is $N\;L\;K\;P\;R\;M\;S\;Q\;T$ DS gate1987 data-structures binary-tree descriptive + – makhdoom ghaya asked Nov 14, 2016 • recategorized Apr 22, 2021 by Lakshman Bhaiya makhdoom ghaya 5.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 30 votes 30 votes We can do as follows: $\text{Preorder}: \overbrace{\text{K}}^{\scriptsize \text{Root}} \text{L N M P R Q S T}$ $\text{Inorder}: \underbrace{\text{N L}}_{\scriptsize\text{Left}} \underbrace{\text{K}}_{\scriptsize \text{Root}}\underbrace{\text{P R M S Q T}}_{\scriptsize\text{Right}}$ kirti singh answered Nov 14, 2016 • edited Nov 5, 2022 by Abhrajyoti00 kirti singh comment Share Follow See all 4 Comments See all 4 4 Comments reply Prashant. commented Nov 14, 2016 reply Follow Share Uplode clear image. 0 votes 0 votes kirti singh commented Nov 14, 2016 reply Follow Share Done!! Still not clear.. den its only fault of light :) 0 votes 0 votes Prashant. commented Nov 14, 2016 reply Follow Share Now fine...:) 1 votes 1 votes Abhrajyoti00 commented Nov 5, 2022 reply Follow Share The Postorder : $NLRPSTQMK$ 0 votes 0 votes Please log in or register to add a comment.
8 votes 8 votes ..... Hira Thakur answered Aug 24, 2017 Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 votes Sorry For Orientation Problem But i didnt found rotate option Rishi yadav answered Oct 4, 2017 Rishi yadav comment Share Follow See all 0 reply Please log in or register to add a comment.