Inorder traversal of threaded binary tree

[@robinskrd]

You are the only teacher who has explained creation, insertion and traversal of threaded binary tree.
And the explanation is so good.
Hope your frequency if uploading videos will increase.

[@nehapatil416]

Thanks for the compliment

[@SohelDarwajkar]

Mam u made this video 3yrs back but honestly speaking still its like a Gem 💎
I too am a student of Pune.. Many of my frnds belong to your college AISSMSIOIT.
But it was me who shared them your lectures 😂😂.. God Bless You mam..
From VIIT pune SY Student.

[@vjy78]

from IT branch ?

[@SohelDarwajkar]

@@vjy78 Comp...

[@vjy78]

@@SohelDarwajkar I'm in IT dsy

[@SohelDarwajkar]

@@vjy78 Lmaoo

[@SohelDarwajkar]

@@vjy78 Division?

[@_AASHISHSHAH]

how creative! you're earning your stripes, TBH you make it look so easy. thank you mam

[@nehapatil416]

Thank you so much for your wonderful words

[@adityasangwai5945]

very nice explanation mam ! ❤‍🔥

[@whoami1320]

Great video mam... U r doing great job by helping us... Thank you very much and make more videos.... 👍

[@girishnavale451]

Very good video for clearing threaded binary concept..

[@akshittomar2401]

great lecture , got the concept in 1 go

[@mohammedmubbashirahmed5683]

Thank u mam for great explanation.

[@santrawebtech35]

madam you are too good i am finding lot of videos related to TBT but your content is really good please make some content for other dsa topic such as graph

[@nehapatil416]

Sure,thanks for the comments

[@thejaypoetry8199]

Good lecture..keep doing mam.

[@udbhavvikramsingh3449]

I did not understand how after printing 10 and after t=t->right; how the pointer *t goes up and check while(t->lbit != 0) i mean how plz explain

[@sumantaeduhub]

1:18 start

[@tanishasrivastava9725]

why ain't you including the head's value in in-order traversal?

[@nehapatil416]

Head is not having any actual value,it's just to attach dangling pointers and for termination in traversal

[@tanishasrivastava9725]

But head is part of the tree and therefore it will mandatorily come in in order traversal. And how come head wont have value ??

[@ishitananda6859]

If you watch maam's threaded binary tree creation video, you'll see that maam has used head only for storing the adds of root. Here the root is 10

[@creativecoding8728]

very helpful

[@___vijay___]

Thanks

[@bristiroy8504]

great maam great

[@yash.dwivedi]

Thanks ma'am

[@123_shreyoshide9]

Amazing

[@nehapatil416]

Thank you