MadeEasy Subject Test: Programming & DS - Binary Tree

Question

Comments

first dry run on paper ... if you understand the recursion well then you will get the solution ..

---

Yeah got the solution.

Answer 1

It will add two new node one will be right child of node 1 & another will be right child of 3, no information regarding new node data is given we will consider it as x & y respectively.

So level order traversal would be

2,1,3,x,y

Comments

answer should be 21313 but given answer is 212133

---

I am getting 212133

First a node(with data=1) is inserted in the right of 1

Next a node(with data=3) is inserted in the right of of 3

Finally a node (with data=2) is inserted in the right of 2 & 3 which was initially the right of 2(root) will be the right(right(root))

 

---

Yes, I got the same answer. You are correct.