Mam in Qn number 13 level order traversal & inorder traversal . But only considering level order traversal instead of in order traversal. But both are not same. Answer is 1,4,8,3,2,5,9(inorder traversal into level order traversal) .Mam really heartful ❤️ thanks for posting these videos mam . Helpful for preparation
Qn is construct a binary tree using inorder traversal and level order traversal. You think that converting unordered to level order. That is not the qn.
@@studywithjbrtrisea 26:49 timing starts for Qn number 13 mam. Mam actually level order traversal in the question is wrong and in answer using only level order traversal , so answer becomes incorrect mam. Mam Correct Level order traversal is 1,4,8,3,2,5,9 and then draw the binary tree is correct (my assumption mam) . Kindly check mam
@@arunkumarr2302 No arun kumar. your level order is wrong. level order means you have to traverse in level by level. the level order for 13th qn is given in the Qn. using that i have drawn the binary tree. now look at the diagram. level 0 contains only root 1. next level one contains 4 and 5, level two contains 9,8,2 and 3. so the level order traversal is 1,4,5,9,8,2,3. hope you understand
@@studywithjbrtrisea Mam as you said correct mam. But level order traversal in question is not correct with respect to inorder traversal of the question .
