Trick Inorder , Preorder , Postorder Traversal (Very easy)

[@s0715]

THANK YOU ITS BECAME SO SO EASY

[@bugrae9341]

Only one word can explain this video Brilliant

[@temitopeoyeyemi899]

one word is not enough bro EVEry goodword is for this video

[@pgupta24]

this is , by far , the BEST EXPLANATION, of binary tree traversals. EXCELLENT JOB!

[@melzz-R6]

Sir! The lecture was very useful for the sem xam...Before I was confused but now it's very simple.... Thanks for sharing your knowledge sir....

[@poornakumari6054]

Simple and layman explanations...you got my subscription. Keep up the awesome work

[@pclaptop2416]

awsome vedio now can solve any preorder postorder and inorder tree with ease!!

[@pradeepasivanesan]

Thank You so much. Your explanations are really very clear. All the institutes need teachers like you.

[@conradt.s]

This is really amazing...traversing in seconds and nothing complicated. Thanks Sir

[@Hieuby_Dooby]

simple and effective way of explaining tree traversal, thank you very much

[@nishthagupta875]

Thank u so much sir this was the easiest way you have taught of traversing

[@temitopeoyeyemi899]

i have exam this morning i watched this , UNDERSTANd everything and and I BLESS you for this SIR

[@kirandhedhi2612]

your videos are saviour for me thanks a lot great!!!!!!

[@sarav-Frontend_Engineer]

Great! idea, thanks! for helping us. Please keep posting more videos :)

[@mikemikailov7515]

Thank you for the great explanation and pseudo-code! "return;" needed at the end of the while-loops, like here: void traverse_po(node* root) {
while (root) {
cout data left);
traverse_po(root->right);
return;
}
}

[@mikemikailov7515]

Another simplified version would look like this:
void traverse_po(node* root) {
if (root) {
cout data left);
traverse_po(root->right);
return;
}
}

[@thotavikram7581]

perfect explanation!!!!

[@walterkwame4390]

Wow this is amazing 👏 😍 🙌
Thank you Sir

[@radhakadam1088]

Sir..thank you so much...sir yours teaching skill are very great and also it is very interesting....

[@rajeshnagaraj7801]

thank you sir. Your lecturing helped me a lot

[@pytha12]

This is the master of the game.

[@JohnCena-ns3cg]

great explanation

[@vivekanandkhyade]

Finally , John Cena..!!

[@tia4friend]

best one..so easy to understand. Thank you

[@vijethavijju1218]

Thank you so muchhhhhh.u made it so simple

[@srivinaytanniru9791]

no words sir !!!

[@saikiransiripuram8747]

Really amazing......but I also want drawing a tree if the preorder and post orders are given.....i hope u would post that one also....

[@SagarTalksOfficial]

really great explanation...

[@bindhusanthosh2197]

Such an awesome class sir ...thankyou so much 🤩🤩

[@sachinsenakulk]

Finally got an awesome, wonderful, amazing video 👏🤟

[@ibrahimyakubudanjaji8308]

Your teaching is very interesting

[@anjuagarwal3974]

Easiest method. Helpful

[@sumitrana3921]

keep posting videos, good work man

[@memeforkids-248]

great sir .... nice trick

[@Alwaysdancedifferent]

Mind blowing trick👌👌👌

[@jingjang21]

Great video! Wish they would teach this method in class...

[@Virgo_6990]

superbbb .....thank u sir ...

[@vivekanandkhyade]

Thanks Somy..!

[@kavyanarla2037]

Your explanation is lit 🔥!

[@ANANDJULU]

Awesome trick and explanation!
Thank you.

[@sanketde4888]

Very Goog.....simply understandable ......wel done...

[@prakharagarwal8448]

Nice explanation!!

[@sonuganiga7803]

Thank you so much sir for this easy method

[@irfankurniawanS]

OMG YOU MADE IT SO EASYYY

[@t.sumithrat.sumithra3420]

IT'S REALLY AWESOME SIR THANK YOU SO MUCH

[@sanduzelai666]

Thank you, great video

[@mwiingachipo9976]

awesome video

[@sstt2247]

May God bless you 🙏🙏🙏🙏

[@fatimah7414]

Many thanks, amazing work you make it super easy

[@marysheelam6799]

Thank you sir.your videos are very useful to me

[@zainabsaeed8413]

you are the best !!!

[@arunkumarv337]

Excellent Explain 👏👏👏👏

[@mynamehero6145]

Thanks alot really helpful

[@SantoshKumar-hg2cp]

Nicely explained!

[@Unique19986]

Very nice video

[@govindganthi8596]

Watch It at 1.25x...
Thank Me Later..
Superb Explanation....

[@peemaps6590]

My life saver

[@NitinRaathi]

great sir... thanks

[@priyanshusomkuwar7772]

Helpful video...

[@sooriyakumarkarnan7885]

great job sir
your learning method is super sir
thank y
ou sir

[@subhajitghosh3867]

One day your channel will be the best for data structure.

[@dharanishankar2443]

Very nice explanation

[@sudheerbabu3050]

Nice trick ... Thank you.

[@nikvolkov1409]

The best teacher)

[@passion4m329]

SUPER SIR ...

[@ΑντρέαςΣωτηρίου-π8γ]

your are the man!!

[@walidiabdoulmalik4867]

thank you very very very very much sir

[@its-probably_fine]

THANK YOU !!!

[@MMfunda]

thank you sir...i would like to learn more from you

[@pujabanik4484]

Oh damn brilliant...🔥🔥🔥👌👌

[@lordsaint4956]

Sir you're great!!

[@jothihem2139]

Super sir

[@prakhargupta2066]

thankyou sir....
I likes your video very much..
I want more videos on file structure..
red black tree
b tree
b+ tree
THANKYOU !!!1

[@pytha12]

Genius!

[@RabiulIslam-lm3pj]

It's really very easy method

[@elif2884]

thank you for valuable informations .

[@hkagnihotri99]

Thank-you

[@mohammedkabirdauda5866]

this video its really helpful!!! Thanks alot

[@jomoljohn8741]

thank you sir.It was really helpful

[@SOUNDHARYAN-ECE]

ur video is very helpfull..

[@ironclock]

amazing

[@tejasdivakar4961]

Amazing!!! sir soo cool!!

[@shivavattikoti4803]

super sir

[@mubashirliaqat3572]

THANKS SIR LOVE YOU

[@punyan775]

Amazing, thank you

[@mithunmallik2115]

very helpful, thanks a lot

[@bikalchapagain6557]

thankyou sir😊😊

[@manisharma2862]

nice bro

[@ksuhas2743]

Sir pls do video on Decrease-and-Conquer approach-Insertion sort and also Topological sorting...

[@yadunandanavr5056]

God sir u are god🙁😱

[@gauravverma9571]

Sir plzz upload a video to construct a tree using preorder and inorder with code also...

[@dskdevaraj1016]

Thank you sir..... 👍

[@rahulsaxena9103]

Can you please explain how to create a binary tree from given inorder and preoder traversal with the help of code? Thanks in advance.

[@roopabeethoju9498]

Did you say a class on Pascal's Identity

[@krishnamase1690]

Super

[@mithuns8410]

million thanks

[@anjuashturkar8417]

Thanks

[@theamjolnir9641]

Are the functions: void function(node *root); recursive and calls itself?

[@DonGonzalito]

I think yes, the "while" is misleading. Otherwise great video!

[@Karan-pz4rk]

U r great thnx 👌✨

[@laxitsinghparmar1578]

Traversal ki Ninja Technique!😂

[@rossinnes]

thanks so much!

[@dharmeshshukla9916]

Please upload some videos on DP(Dynamic Programming)

[@SLCODEGEN]

thank sir

[@filladelphiaify]

This is indeed a trick.