Recursive Postorder traversal of a Binary Tree in Java

[@itsdineshvaryani]

Please *Like* , *Comment* , *Share* , *Subscribe* and *Click Bell* 🔔🔔🔔 Icon for More Updates. To get *Data Structures and Algorithms* complete course for free please follow this link - ua-cam.com/play/PL6Zs6LgrJj3tDXv8a_elC6eT_4R5gfX4d.html

[@ujjwaljagtiani5760]

Never have I seen someone explaining trees recursion so well. Wonderful !

[@itsdineshvaryani]

Thanks !!!

[@sameergrover7]

There are n number of channels on youtube but the way you teach things is completely different it's simple, precise and just point to point no rubbish ! You are great sir! Thank you for the wonderful videos never stop teaching us !

[@itsdineshvaryani]

Welcome

[@travelnlearn]

You have made pre post and inorder easier for us to understand. Thank You , these videos are a gem for me.

[@itsdineshvaryani]

Thanks ... Please share it with your friends and colleagues too !!!

[@shubhamagarwal1434]

Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over UA-cam with java implementation and found this. Hats Off To You Man..Excellent Work. GOD BLESS YOU :)

[@itsdineshvaryani]

Thanks !!!

[@vigasvigas8848]

I'm searching for long days, this kind of explanation for recursion..thanks for making the concept of recursion easier

[@itsdineshvaryani]

Welcome !!!

[@chinthanasachin1684]

Finally I found this video which has a detailed explanation about Postorder Traversal in java. Top quality explanation! Thanks a lot!

[@itsdineshvaryani]

welcome !!!

[@bharathenishetty1550]

superb video what a patience, clean and clear cut explanation

[@itsdineshvaryani]

Thanks !!!

[@samjam_93]

Iterative approach pseudo:
Stack s1 = new Satck();
Stack s2 = new Satck();
s1.push(root);
while(!s1.isEmpty()){
temp = s1.pop();
s2.push(temp)
if(temp.left != null) {
s2.push(temp.left);
}
if(temp.right!= null) {
s2.push(temp.right);
}
}
Now pop all the elements of s2 stack they will be in post order

[@itsdineshvaryani]

Try to use one stack !!!

[@anupmistry479]

Best channel for learning DSA.

[@itsdineshvaryani]

Thanks !!!

[@ascar66]

Thank you sir, nice video! Comment to support your channel

[@itsdineshvaryani]

Thanks !!!

[@maruthiprasanna815]

very good explanation. Can you please post other videos in this series? For dynamic programming, greedy algorithms and graph theory, String algorithms..

[@aadityajaiswal1970]

Sir,which one should we follow, recursive or iterative approach.

[@itsdineshvaryani]

both hv similar complexities ... recursive is easy to write !!!

[@alokpal7347]

best explanation sir ji

[@itsdineshvaryani]

Thanks !!!

[@audricrukerikibaye3704]

Thanks buddy!! your video was awesome and very helpful!!

[@itsdineshvaryani]

You're welcome!

[@shubhamsingh-lf6zy]

Sir when value is null why execution goes to 6 why not to 1?

[@itsdineshvaryani]

Can you ping me a video timeframe where u cannot understand?

[@abinashbarik5128]

Hi SIr ..I want a video on quick sort and some video on stack prefix and suffix

[@NabilaNazirkhan]

Is it okay to have a method as "public void postorder(){// if() return}" and have a return statement within it?

[@itsdineshvaryani]

void methods can have return statement.

[@tc07client5]

Thanks for explaining the code!

[@cupofjava5480]

thank you

[@itsdineshvaryani]

Welcome

[@jaspalsingh-mv5xh]

Great

[@itsdineshvaryani]

Thanks !!!

[@debashishpattnaik4662]

At 17:08, line no. was changed from 5 to 6. Can u explain a bit further, why changed.

[@Stephen_Samuel]

*postOrder(root.left);* of 9 was completely executed, therefore *postOrder(root.left);* (i.e the next line) is being executed next.

[@arbindmandal5605]

Awesome video

[@itsdineshvaryani]

+Arbind Mandal Thanks !!!

[@itsdineshvaryani]

+Arbind Mandal thanks !!!