Postorder Traversal (Left, Right, Root): 1. Traverse the entire left subtree, starting from the leftmost leaf. 2. Traverse the entire right subtree, starting from the rightmost leaf. 3. Visit the root node. For the given tree: 7 / \ 2 3 / \ 1 4 Postorder Traversal: 1, 2, 4, 3, 7 Inorder Traversal (Left, Root, Right): 1. Traverse the entire left subtree, starting from the leftmost leaf. 2. Visit the root node. 3. Traverse the entire right subtree, starting from the leftmost leaf and then move to the root of the right subtree. For the given tree: 7 / \ 2 3 / \ 1 4 Inorder Traversal: 1, 2, 7, 3, 4 Visualizing Traversals: 1. Postorder Traversal: - Visit 1 (leftmost leaf) - Visit 2 (parent of 1) - Visit 4 (rightmost leaf) - Visit 3 (parent of 4) - Visit 7 (root) 2. Inorder Traversal: - Visit 1 (leftmost leaf) - Visit 2 (parent of 1) - Visit 7 (root) - Visit 3 (right subtree root) - Visit 4 (rightmost leaf) Key Points: - Postorder: Visit all descendants (leaves and inner nodes) before visiting the parent nodes. - Inorder: Visit all nodes in the left subtree first, then the root, then all nodes in the right subtree.
Bhaiya if possible then plz windup the java and c++ tutorial in one video with notes like c and python .. it will be really helpful for us...i already completed both c and python..such an amazing notes very helpful..thank you very much harry bhaiya 😊😊
Harry Bhai !!! After Completing DSA Playlist: Can You Please Make Video On Multithreading And Exception Handling And other Topic That Are not Completed In "C++ Course"
Harry is best ....love you yaar Bhai kya aap whitehat jr ke upar eak vedio bana sakte ho because of they are ruining money and time of uneducated (in programming) parents and their kids Unka bina naam liye nahi to sale copyright maar denge..........
I'm getting the same answer as the original comment...but you said that the 2 becomes the root... My doubt is...how does the 2 become the root? As if you look at the original root 7 clearly 2 is it's left subtree so...I'm confused 😐
6:50 What a great strategy to remember preorder, postorder and in order traversals
I am commenting this because I can't believe that such a good content has so few likes but Harry BRO u r doing mind-blowing work keep it up
11:55 PostOrder traversal --> 12437
InOrder traversal --> 12734
how bro
@@ritikkumar6483 if you take the subtree, apply postfix on that too, not only on the entire tree
glt hai
@@kundankumarkushwaha1978 sahi hai
Bhai postorder ka 21347 and inorder ka 21734 hoga kyuki haryy bhai ne parent / upar se likha h
11:53
post order :12437
in order :12734
Studying with an IITian is an quite amazing experience I have got so far.
Postorder Traversal (Left, Right, Root):
1. Traverse the entire left subtree, starting from the leftmost leaf.
2. Traverse the entire right subtree, starting from the rightmost leaf.
3. Visit the root node.
For the given tree:
7
/ \
2 3
/ \
1 4
Postorder Traversal: 1, 2, 4, 3, 7
Inorder Traversal (Left, Root, Right):
1. Traverse the entire left subtree, starting from the leftmost leaf.
2. Visit the root node.
3. Traverse the entire right subtree, starting from the leftmost leaf and then move to the root of the right subtree.
For the given tree:
7
/ \
2 3
/ \
1 4
Inorder Traversal: 1, 2, 7, 3, 4
Visualizing Traversals:
1. Postorder Traversal:
- Visit 1 (leftmost leaf)
- Visit 2 (parent of 1)
- Visit 4 (rightmost leaf)
- Visit 3 (parent of 4)
- Visit 7 (root)
2. Inorder Traversal:
- Visit 1 (leftmost leaf)
- Visit 2 (parent of 1)
- Visit 7 (root)
- Visit 3 (right subtree root)
- Visit 4 (rightmost leaf)
Key Points:
- Postorder: Visit all descendants (leaves and inner nodes) before visiting the parent nodes.
- Inorder: Visit all nodes in the left subtree first, then the root, then all nodes in the right subtree.
best coding instructor of my life
Me toooo
ok
Harry bhai, sahi mein aapse accha TH-cam pe koi nahi padhata. You are great🙏🙏
11:50
Postorder traversal : 12437
Inorder traversal : 12734
5:43
PreOrder Traversal for the sample tree -> 72134
PostOrder Traversal for the sample tree -> 12437
InOrder Traversal for the sample tree -> 12743
InOrder traversal should be 1 2 7 3 4
@@manjitsharma889 Oh yeah
Thanks bro. Silly mistake
Inorder traversal will be 1,2,7,3,4.
Post Order Traversal - 1, 2, 4, 3, 7
Inorder Traversal - 1, 2, 7, 3, 4
it is correct!!
Thankyou sir...u help me very much ...thanks a lot
Best helpful videos for data structure 😍😍
12:04 post tree traversal= 1,2,4,3,7 and in order traversal= 1,2,7,4,3.
In order 12734
@@pahadiraishgamer1777 how why is it not 12743
@@vanshika5721 because 4 is on the right subtree and in case of in-order, root(here 3)comes before right subtree.
☺️
I also had the same doubt
Thanku @chetan kumar
The dislikers are those who were so happy, that they started crying and accidentally pressed/clicked wrong button because of the blurry eye.
Bro, your justification is to the point 👌😂
I was literally struck in pre order traversal for past 1 hour and thank you so much this helps me so much to undertake thank you so much 💜
Same was with me 😊 by the way where are from India or middle east
@@thechoticworld106 from Pakistan
hey bhai m r mri sis apky channel sy web development course kr rah hu bht axa h ... bht helpful h mry liay stay blessed bro
HOPE you REACH 1m SOON!!!!!!!!!!
Harry bhai is the king of programming
1.75 speed is recommended thanks me later
Your great sir 👍❤
Best explanation bhai❤️
Post order : 1 2 4 3 7
In order : 1 2 7 4 3
Thank you Harry bhai.
Bas React JS pe tutorial bana dena
I was able to make an ATM by the help of your PYTHON TUTORIAL.
Love you ❤️
I want react js too
Bhaiya if possible then plz windup the java and c++ tutorial in one video with notes like c and python .. it will be really helpful for us...i already completed both c and python..such an amazing notes very helpful..thank you very much harry bhaiya 😊😊
Yes me too completed
Please may I know what package u got, after learning so many languages?
11:35
Preorder = 72134
Proorder = 12437
Inorder = 12734
8:42 post order ❌ pre order ✔️
😂
Thank You So Much Harry Bhai🙏🙏🙏🙏
1 million on the way....😊😎
Postorder traversal - 12437
Inorder traversal - 12734
Bhai postorder ka 21347 and inorder ka 21734 hoga kyuki haryy bhai ne parent / upar se likha h
You are the best Harry bro.... No doubt 😀
Yippeee... Got first heart today from Harry bro 11dec2020.... Never forget😅✔️✔️🎊🎊
Sir,please Ruby and Perl language bhi sikha dijiye.😭🙏🙏🙏🙏🙏🙏
If you are interested in gaming then,
Check Gameplex.
No
Harry Bhai !!! After Completing DSA Playlist: Can You Please Make Video On Multithreading And Exception Handling And other Topic That Are not Completed In "C++ Course"
Harry bhai plzz continue ds lectures
Post prefer traversal-12437
Inorder traversal-12734
kemon acho kon college?
Bhai postorder ka 21347 and inorder ka 21734 hoga kyuki haryy bhai ne parent / upar se likha h
11:45
postorder:-12437
inorder:-12734
Harry bhai gr8 fan , ur my inspiration
11:56
Post Order-> 1 2 4 3 7
In Order-> 1 2 7 3 4
12:03 Post order - 12347
In order - 12734
Harry bhai please cover the topics of DSA 🙏🙏🙏🙏
thank you bhaiya😘😘😘😘😘😘😘😘😘
Harryy bhai plzz continue ds lectures
Android course with notes 🔥
post order-1,2,4,3,7 in order-1,2,7,3,4
Thanku sir for this information 🙏
You are spreading knowledge to the world thank you bai
Goat=harry bhai❤❤
I watch your python video
11:46 postorder --> 12437 inorder --> 12734
HarryBhai is course ko jaldi complete kardo
Thank you so much harry bhai for such a great course 🙏🙏
pre-7,2,1,3,4
post-1,2,4,3,7
in-1,2,7,3,4
Harry Bhai Zindabad
Nice sir 👍👍👍👌👌👍👍👌👌👌
First viewer😎😎😍
Superb video Harry bhai ❤️
11:52 (1 2 4 3 7)=>postorder traversal
(1 2 7 3 4)=>inorder traversal
Post order-12437
Pre order-12734
Done😊
Thanks Harry Bhaiya
11.50->>>>
Postorder: 21347
Inorder: 12734
Thank you Harry bhai 🔥
Thankyou so much 🙇♀️
Shreya Singh. Post order= 12437......and inorder= 12734
can u tell me your faculty and sem?
C# course please sir
🥺
কোড উইথ হ্যারি🔥🔥🔥🔥
Very nice software to teach , notepad
Make a course on c# language...I am very fond of it
Harry is best ....love you yaar
Bhai kya aap whitehat jr ke upar eak vedio bana sakte ho because of they are ruining money and time of uneducated (in programming) parents and their kids
Unka bina naam liye nahi to sale copyright maar denge..........
15 hours Java course Harry sir
There Is No Shortcut To Coding . Learn Step By Step Otherwise You Will Not Understand P of Programming
8:12 this technique is very helpful i m very worry abt tht
Love you Harry bhaiya ❣️❣️❣️
just one word for you i love you
Post order traversal : 12437
Inorder Traversal: 12734
Awesome Video.......Welll Explained.
Din ki 5 videos daily aaajaye toh mazza aajaaye
Great Video Sir
Love u harry bhai
Sir pls complete this course as my exams are coming so pls sir pls
1,2,4,3,7 ---Post order
1,2,7,3,4----inorder
Post order traverse 21347
In order traverse 21734
It is using head recursion
I'm getting the same answer as the original comment...but you said that the 2 becomes the root...
My doubt is...how does the 2 become the root? As if you look at the original root 7 clearly 2 is it's left subtree so...I'm confused 😐
@@derilchundakal5828 you have look each subtree isolated, then 2 will root of this isolated left subtree. Things are happening recursivily
Thanks Harry
Sir pls can u complete this course as fast as possible becoz my exam r coming on 23 dec
Mine in 2 hours!
Bro pls make dart tutorials and flutter tutorials for app development
Thx for teaching
5:20 Harry bhai yee konsa type ka binary tree hain??
thanku sir
so much
900K ABOUT TO COMPLETE!
Post order: left-subtree -> right subtree-> root
In order: left subtree-> root -> right subtree
11:45
Post order ---- 1 2 3 4 7
Inorder ------ 1 2 7 3 4
12437 & 12734 respectively
post and inorder respectively.
Bhai postorder ka 21347 and inorder ka 21734 hoga kyuki haryy bhai ne parent / upar se likha h
i was the 1000th person to like
HAHAHAHA
Postorder -> 12437
Inorder -> 12734
11:45
PostOrder - 1-2-4-3-7
InOrder - 1-2-7-3-4
Please make a video on how to make python bot to attend online classes(microsoft teams)
Lakshit Choudhary 😂😂😂
Lakshit Choudhary I want google meet
Harry bhai 👋👋
postorder traversal :-2,1,3,4,7
inorder traversal:-2,1,7,3,4
Post order:12437
Post order :- 2,1,3,4,7
In order :- 2,1,7,3,4
Life Saver.
Postorder 12437
In order Traversal 43721
bhai ye toh god h
11:41
postOrder-> 1 2 4 3 7
InOrder-> 1 2 7 3 4