GATE CSE 1987 | Question: 7b

Question

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$

Answer 1

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}}$

Comments

Uplode clear image.

---

Done!! Still not clear.. den its only fault of light :)

---

Now fine...:)

---

The Postorder : $NLRPSTQMK$

Answer 2

.....

Answer 3

Sorry For Orientation Problem But i didnt found rotate option