Morris Inorder Tree Traversal

/ tusharroy25
github.com/mission-peace/inte...
github.com/mission-peace/inte...
Inorder iterative traversal of a binary tree without stack or recursion. This traversal is called Morris traversal.

[@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:}

[@alexnice2221]

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

[@kakhapilauri7251]

so nice 😊

[@mierta7751]

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

[@gooomarco]

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

[@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

[@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.

[@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.

[@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!

[@aaronschwartz-messing4701]

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

[@Virtualexist]

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

[@fettuccine794]

Same thoughts

[@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.

[@abhaypatil2000]

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

[@mishapetin4386]

I am very thankful for your clear explanation and pronunciation!

[@ShabnamKhan-cj4zc]

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

[@ankithas1868]

i really appreciate the hard work to teach us thank you

[@user-vr2go1bj5b]

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!!!

[@shuxuannie1470]

The best video about morris! Love your video!

[@anhminhtran7436]

You explain very well. Thank you

[@sachin_yt]

Amazing explanation man, props to you!

[@amanbhadauria2881]

Loved your explanation

[@manasranjan7894]

The best explanation I found on youtube so far

[@tanujabharti8043]

Thank you for all your videos :)

[@weilihe8989]

Great, very intuitive and explanative

[@nabidulalam6956]

Precise and sweet explanation. thanks :)

[@VipinChaudhary14119]

Explanation was very nice , thanks for the vid :D

[@udemycourse4435]

Thank you very much for the clear explanation.

[@neerajchoudhary3709]

his diagram is clean and clear enough to demonstrate the concept

[@nitinadarsh]

Awesome explanation, made this complex algo smooth.

[@Nampjg]

Explanation is Awesome !

[@utkarshtiwari7738]

Super good explanations!

[@blacktrojan3313]

Best explanation of Morris traversal on the internet

[@sanjayizardar2263]

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

[@sammyiboi]

Awesome! Thank you Tushar!! :D

[@dhruvsethut]

Nicely explained. Thanks!

[@uwaismanzoor]

Awesome man... Nice explanation

[@Mel-jp5vb]

Great walkthrough, thank you!

[@tolerancepark4087]

Thank you for your explanation.

[@pulkitnijhawan1059]

awesome explanation Much much better than Geeks for geeks

[@shiveshdixit1640]

Excellent explanation !!

[@YongboLi]

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

[@HaiderAli-nn3gy]

Very Good Explanation Thanks

[@reconnect10]

your speaking is way better than others

[@kfliden]

Thanks, best video on this algorithm!

[@user-oq6jg3gl8k]

Great explaination!

[@gg142000]

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

[@scotthall6005]

Excellent explanation!

[@tusharsinha313]

Nice explanation!

[@VishalSharma-hq5ti]

Amazing as always!!

[@MrRantelo]

Thanks a lot!
Great explanation

[@uttamnandi124]

very well explained..thank you so much

[@vartikapriyadarshini4511]

Very good explanation!!

[@niranjanprithviraj]

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

[@omkarrasal1395]

Very nice explanation 🙌🙌

[@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.

[@nikhilrathore2385]

really made it easy to understand

[@Lisa-kk6go]

Thanks so much for making my life easier!!!

[@lovekeshmadaan2767]

thanks, sir really nice explanation....!

[@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.

[@tomtao4991]

That's great explanation!

[@pluviophile762]

Nice explained♥️

[@tanloc1273]

very clear, thank you so much

[@paragroy5359]

Nice explanation sir...

[@adityapasari2548]

Excellent video

[@jianingzhuang104]

Great video! Thanks.

[@kartikeydixit3743]

thanks for the explanation

[@sarastanway8861]

clean algorithm, beautifully explained. thank you so much!

[@nancyli8313]

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

[@SachinSingh-im2qm]

Nice explanation

[@adityatrived.i]

Nice Explanation

[@sarramarmouche8344]

Thank you great explanation

[@cartersuppes9434]

very clear thank you so much

[@mridulmittal5953]

awesome stuff mate..awesome

[@coderajput1816]

nice explanation..thank u sir

[@HarshNigamhello]

nice explanation

[@madhumithakarthikeyan1877]

Thanks Tushar ! :)

[@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!

[@sureshgarine]

could you please make similar videos for Morris traversal for priorder and post order traversal

[@sakshi6095]

Good Explanation. :)

[@FrankZChen]

Very clear!

[@freesoul2677]

Thank you!

[@ganapatibiswas5858]

Thank You

[@rusenyan4021]

nice explanation!

[@jatingupta5986]

That was amazing

[@nitingupta1417]

nice video!

[@houseisforthesoul]

I love this guy

[@chiraglosalka6893]

how is the time complexity O(n)... we are revisiting nodes in a loop many times...

[@karthikeyy]

Great Explanation sirji...

[@nagarohitkatta3830]

Good Explanation

[@albertagram]

Thanks for this

[@lokesh-qz6cc]

what a beautiful algorithm!!

[@BlueBunnyGamer]

I've watched this like 10 times xD

[@siliyang2700]

Great Video

[@shubhamsingh-nt9mm]

God bless u.. So much :)

[@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.

[@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.

[@jineshdhruv6151]

Will the algorithm work if we have duplicate elements in the tree?

[@amithrc3026]

if you are using Trees to implement map data structure which does not allow duplicate,do not insert the duplicate element at the first place

[@anandkulkarni2111]

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

[@morelfotsing2221]

Talk about an elegant algorithm.

[@fahrankamili7931]

predecessor.right will always be null right? Because if a predecessor of a current node has a right child, then that right child is the predecessor of the current node, no?

[@fahrankamili7931]

Nevermind, we need that if statement to see if we establish a link to a "current" node