simplest way to find preorder given inorder and postorder | construct binary tree
ฝัง
- เผยแพร่เมื่อ 12 ก.ย. 2024
- This video explains given inorder and postorder of a binary tree, how to find preorder and even how to contruct a binary tree from given information. This makes use of recursive method and the CODE LINK is given below. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
CODE LINK: drive.google.c...
You're better than my teacher that explained it for hours it saved me a lot of time thanks.
You made it so easy to understand. Thanks Sir.
Welcome :)
Worth watching:) Thanks!!
Welcome :)
Thank you sir..... You made it so easy.....
Welcome
Thank you for your clear explanation, sir
Life saver!
Nice explanation 💫💯
helped in my interview
Nice :)
good explanation
Thanks
Nice explanation
Very nice trick
Thanks
Thanks
welcome
God brought me here to easily understand this topic! Thankyou Brother.
You explanation and code provided in the description says different stories. Can you please add a explanation for your code as well?
Sure
big brain
you have said in the tittle that there is code with this trick ...where is the code .....????
Please check the link in description below.
thankyoo
this tree is too basic, could you please give an example for a more complex tree?
Sir how to find preorder only from given inorder.
Can di find it ? I don't think so (unless we are given some more info about the tree).
@@techdose4u they asked liked when inorder traversing a tree result is E A C K F H D B G.
Then preorder would return ??
A) F A E k C D B H G
B) F A E K C D H G B
C)F E A k D C H B G
Please explain code plzzzz
Not a good way to teach.. Change ur method...
What should I do?