Morris Inorder Tree Traversal

[@alexnice2221]

Good luck to everyone working hard to be at good tech companies. Thank you for the explanation.

[@kakhapilauri7251]

so nice 😊

[@sidharthbihary2475]

came here when I didn't get the geeksforgeeks explanation. you have explained it lucidly.

[@omkarrajmane9408]

I came like that as well. Lol!

[@AniketKumar-xg3ky]

same her bro..

[@mhdmedfa]

Me too

[@35sherminator]

Me too :-)

[@yuvaranikannan9297]

Me too:}

[@kayysean99]

You never fail to impress. Your explanations are always crystal clear and easy to understand. Thanks for sharing your knowledge!!

[@bewareofnikhil]

I have skipped Morris Traversal for the past 7 years because I never understood it. Turns out, I only had to watch this 10 minute clip. Thanks a ton man.

[@roman_mf]

Out of all Morris algorithm explanations out there, yours is so much better. Thank you!

[@gooomarco]

Thank you! This was the best explanation I found. Instead of going straight into algorithm, Tushar explained the thought behind it. Great job.

[@rajankhunt7002]

Almost I gave my 2 hours to understand this algorithms on others channel but when I watched this video I got it. Great explanation.

[@jubjubfriend64]

Man I spent like 2 hours trying to understand the code, but visually seeing it step by step made it finally make sense, thanks!

[@manasranjan7894]

OK man

[@mierta7751]

Thank you Tushar! Your video is always a guarantee of crystal clarity. Kudos!

[@Virtualexist]

Best explanation ever. Better than pepcoding, better than Striver.

[@fettuccine794]

Same thoughts

[@panchajanya1967]

It’s a good explanation for those looking in to the problem already and stuck with solving it. For those looking in to the problem first time, it would help if the pace of explanation is bit slower.

[@aaronschwartz-messing4701]

Thank you! This is the most thorough video explanation on Morris Traversal that I have been able to find.

[@neerajchoudhary3709]

his diagram is clean and clear enough to demonstrate the concept

[@cameronswartzell5251]

There's a LOT of bad articles poorly explaining this, and I gave up after checking a few. This cleared it up pretty quickly. I do wish in his first pass he hadnt abstracted findPredecessor() into some invisible function.

[@JIHYELEE-h2m]

Wow the intro is so good!! now I understand why thread(link) is needed! bc we have to come back root, without stack or recursion! wow Thanks my teacher!!!

[@abhaypatil2000]

Best person to explain complex topics. I wonder why his channel is not very famous?

[@ShabnamKhan-cj4zc]

Thanks tushar For explaining in simple manner with algorithm and code.

[@himanshusharma7417]

Hi Tushar. I want to thank you for this video. I looked at almost all sources that explain morris traversal but yours actually made everything clear in my mind. Keep making more videos like this. Thanks again.

[@mishapetin4386]

I am very thankful for your clear explanation and pronunciation!

[@blacktrojan3313]

Best explanation of Morris traversal on the internet

[@manasranjan7894]

The best explanation I found on youtube so far

[@reconnect10]

your speaking is way better than others

[@pulkitnijhawan1059]

awesome explanation Much much better than Geeks for geeks

[@pelinavsar4498]

Beautifully explained, thank you. Subbed.

[@amanbhadauria2881]

Loved your explanation

[@paragroy5359]

Nice explanation sir...

[@kfliden]

Thanks, best video on this algorithm!

[@Nampjg]

Explanation is Awesome !

[@shwetayadav5256]

Excellent explanation of Morris Algorithm !! keep up the good wrk Tushar !! I keenly follow your videos and they are immensely helpful in understanding concepts of Compute rScience.

[@weilihe8989]

Great, very intuitive and explanative

[@gg142000]

A+++++ explanation. Really appreciate it!

[@omkarrasal1395]

Very nice explanation 🙌🙌

[@vartikapriyadarshini4511]

Very good explanation!!

[@HaiderAli-nn3gy]

Very Good Explanation Thanks

[@Mel-jp5vb]

Great walkthrough, thank you!

[@shuxuannie1470]

The best video about morris! Love your video!

[@udemycourse4435]

Thank you very much for the clear explanation.

[@dnyaneshwarchavan7154]

Clean and precise explanation !!

[@nitinadarsh]

Awesome explanation, made this complex algo smooth.

[@uwaismanzoor]

Awesome man... Nice explanation

[@d123-y5i]

Great explaination!

[@sarramarmouche8344]

Thank you great explanation

[@YongboLi]

Man, you are always so helpful explaining those fancy algorithms.

[@tanujabharti8043]

Thank you for all your videos :)

[@houseisforthesoul]

I love this guy

[@ankithas1868]

i really appreciate the hard work to teach us thank you

[@nabidulalam6956]

Precise and sweet explanation. thanks :)

[@anmoljain5910]

I think the worst case time complexity will be O(n^2). Correct me if I am wrong. Coz we will have to find inorder predecessor for all nodes. And in case of skwed tree, it will take O(n^2) time.

[@karthickramesh4411]

The TC will still be 2N which is O(N) as the nodes visited at max twice.

[@tomtao4991]

That's great explanation!

[@ismail8973]

Nice explanation

[@sachin_yt]

Amazing explanation man, props to you!

[@tusharsinha313]

Nice explanation!

[@morelfotsing2221]

Talk about an elegant algorithm.

[@anhminhtran7436]

You explain very well. Thank you

[@taotang6557]

very clear explanation!

[@ganapatibiswas5858]

Thank You

[@adityatrived.i]

Nice Explanation

[@nikhilrathore2385]

really made it easy to understand

[@pluviophile762]

Nice explained♥️

[@uttamnandi124]

very well explained..thank you so much

[@StartWithShikhorRoy]

Thanks for your hard work for making such nice videos! But it would be great if the video explains algorithm derived from concept behind it. What I understand, concpet is the first thing then algo comes. You explan such a way where algo comes first then explain the concept based on the algo! Thank you!

[@kartikeydixit3743]

thanks for the explanation

[@scotthall6005]

Excellent explanation!

[@HarshNigamhello]

nice explanation

[@cartersuppes9434]

very clear thank you so much

[@FrankZChen]

Very clear!

[@erniethenyctabby2915]

thank you for the video!! but at 7:27 current = current.right, but you were pointing to the wrong place on the white board.

[@dhruvsethut]

Nicely explained. Thanks!

[@VishalSharma-hq5ti]

Amazing as always!!

[@Lisa-kk6go]

Thanks so much for making my life easier!!!

[@jianingzhuang104]

Great video! Thanks.

[@weihou3484]

good explanation, Sometimes I feel it's really helpful for yourself to understand better by presenting your idea to others

[@tolerancepark4087]

Thank you for your explanation.

[@rusenyan4021]

nice explanation!

[@newworldorder25]

Very well explained ... !!!!

[@dsa3702]

The last, please like this video..damn he spoke at 3x!

[@sammyiboi]

Awesome! Thank you Tushar!! :D

[@srigopalsai]

your videos are awesome Tushar. Great work.

[@VipinChaudhary14119]

Explanation was very nice , thanks for the vid :D

[@supremepancakes4388]

This is much clearer than the explanation on the geekforgeeks channel.

[@freesoul2677]

Thank you!

[@shawnmofid7131]

Thank you so much. I kept looking at an implementation and had a hard time trying to figure out what was happening. I got it now.

[@nancyli8313]

Thanks for your explanation! I was confused about Morris Traversal, but you video make me clear now.

[@madhumithakarthikeyan1877]

Thanks Tushar ! :)

[@debabhishek]

well explained Tushar.. Just one comment for the viewers this Morris approach can be for Pre order traversal also ..and with just 1 line change in the existing code..( let it be a exercise for the viewers)

[@debabhishek]

+Tushar Roy oh !! I had not seen the full video earlier.. yes its there..

[@thealgorists60]

For Morris Postorder feel free to take a look at www.thealgorists.com/Algo/Tree/MorrisPostorder . Morris Postorder algorithm and code are beautifully explained there.

[@sakshi6095]

Good Explanation. :)

[@mridulmittal5953]

awesome stuff mate..awesome

[@sanjayizardar2263]

Thank You Tushar.. Nice explanation. It really helped me.

[@MrRantelo]

Thanks a lot! Great explanation

[@coderajput1816]

nice explanation..thank u sir

[@niranjanprithviraj]

Dude, you're awesome. Thank you for these videos.

[@sarastanway8861]

clean algorithm, beautifully explained. thank you so much!

[@adityapasari2548]

Excellent video

[@everydaywarriors]

Patience, friends. Bit by bit.

[@anandkulkarni2111]

Explanation is excellent , simple request is to talk at steady pace. a bit slower ...then it will be much easier to absorb :)

[@tanloc1273]

very clear, thank you so much

[@fang2hou]

very clear, thanks :)

[@nagarohitkatta3830]

Good Explanation

[@siliyang2700]

Great Video

[@The_Helping_Hand_1997]

thanks, sir really nice explanation....!