0 votes 0 votes DS made-easy-test-series data-structures binary-tree + – sushmita asked Mar 26, 2017 recategorized Mar 5, 2019 by adeebafatima1 sushmita 557 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply vijaycs commented Mar 26, 2017 reply Follow Share first dry run on paper ... if you understand the recursion well then you will get the solution .. 0 votes 0 votes sushmita commented Mar 26, 2017 reply Follow Share Yeah got the solution. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 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 Tesla! answered Apr 1, 2017 Tesla! comment Share Follow See all 3 Comments See all 3 3 Comments reply Kaluti commented Jan 14, 2018 reply Follow Share answer should be 21313 but given answer is 212133 0 votes 0 votes srivivek95 commented Jan 14, 2018 reply Follow Share 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)) 1 votes 1 votes Rohit9846 commented Sep 26, 2019 reply Follow Share Yes, I got the same answer. You are correct. 0 votes 0 votes Please log in or register to add a comment.