In order to reduce wastage of space we started using threaded binary tree so that the null pointers points to something meaningful, but due to that the problem which arouse concluded to the solution of using flags , which is actually more wastage of space
Sir your videos are awesome and these videos helped me alot to understand a lot of DS problems. Thanks again. Thats what i say contribute to community.
Sir, excellent explanation. My compliments. I'd like to ask, about the purpose of the Dummy Node. Just wondering whether there is any convention to redirect the link of the extreme left and right child nodes to point to themselves instead of the Dummy pointer? Its just a wild though. Could you please take the pain to ponder on it? Thanks & Regards
in order to maintain the uniformity of threads, we maintain a special node called the header node. The header node does not contain any data part and its left link field points to the root node and its right link field points to itself. If this header node is included in the two-way threaded Binary tree then this node becomes the inorder predecessor of the first node and inorder successor of the last node. Now threads of left link fields of the first node and right link fields of the last node will point to the header node.
how would you go about doing a pre-order addition to the same binary tree and then traversing it in pre-order? i have already written the code for a in order threaded binary tree as well as the traversal for in order however i cant seem to figure out what the pre-order implementation would look like for adding to a TBT in pre-order especially when you have right children that you need to point to that are on the other side of the tree im currently using 3 pointers to keep track of the nodes as i need them to hold the temporary place within each node i need to point to next.
Nice explanation, But how it is useful from Binary trees? And instead of introducing a dummy node, why cant we set the left and right flag integer as -1 and set the left and right pointer as NULL? so -1 represents NULL.
![INORDER SUCCESSOR in binary search tree[CODE Explained]](http://i.ytimg.com/vi/JdmAYw5h3G8/mqdefault.jpg)
I can't BELIEVE how much this video helped me understand threaded trees. You rock, sir! Thank for this amazing video!
Can't believe this level of content is available for free..
Thank you sir.
One of the best explanations I've seen for this topic , thank you so much sir
cant believe i watched this video before,so apparently i forgot all the knowledge,all right this time i will remember ,thank you
Having an exam tomorrow and I can't BELIEVE how much this video helped me understand threaded trees. You rock, sir! Thank for this amazing video!
Same situation and I'm so grateful to sir
The purpose of Threaded binary tree is to make use of the NULL nodes.
Here we fill the null nodes with Reference of other nodes.
Superb
Thanks 🤗
Intuition behind this?
sir... u r excellent in teaching..... u r
very good in teaching....😊👏👏👏👑👑👑👑👑
This tutorial makes mad man to geeks in dataStructures. Excellent
great person,
i understood this topic greatly as this topic is not my syllabus
thanks you for making videos
sir! thank for giving us a very very powerful easy ways to understand DS.........
Slow even at 1.5x, but good teaching 👍.
I watched it at 2x 😂
Me watching it at 2x
It was still slow at 2x but anyway it was worth it
Wow Amazing explanation. You are a great teacher Sir❤
In order to reduce wastage of space we started using threaded binary tree so that the null pointers points to something meaningful, but due to that the problem which arouse concluded to the solution of using flags , which is actually more wastage of space
my thought too
It is a good way to teach... because of slow teaching is better than the review of video
Superb sir...tq very much... we have vtu exams on 19 april.... ❤❤❤
Thanks alot for providing your knowledge with the future programers of nation
Sir your videos are awesome and these videos helped me alot to understand a lot of DS problems. Thanks again. Thats what i say contribute to community.
Thankyou sir! This cleared a lot of my doubts!
I finally found a video that I can understand. thank you .
thankuhh somuch sir ,this content is very helpful for me ...
Its very clear explanation...i understand verywell...thank you sir
Easy engineering clAses r awesummmmmm...love u sir.....
Incredible video, thanks a lot!!!
best explaination of tbt ..thanks a lot sir
Not all hereos caps ...salute to you sir🙂🙃
Very Nice Explanation Sir 🙏🙏
thank you very much :) amzing explanation
superb, thanks it is very useful to every one
Sir your video is most helpful .
Nice explanation. Thank you sir.
Sir..please doa video on selection trees,kd trees,leftlist trees and binomial heap...ur explanation is too good to understand..plse sir
Great helpful before exams....
V detailed and amazing explanation 👍🏻 thanks a lot 😌💗
Exam kaise gaye
Great explaination sir.
Excellent teaching I found what I needed 🔥👍
Thanks. Your lecture is very easy to understand. I like it! :))
Very beautiful explanation sir.
Nice explanation sir 👍
Great Explanation. Thanks for your hard work
very nice explanation sir🙏🙏🙏🙏
Wow . Concept clear af 👌
Sir, excellent explanation. My compliments.
I'd like to ask, about the purpose of the Dummy Node.
Just wondering whether there is any convention to redirect the link of the extreme left and right child nodes to point to themselves instead of the Dummy pointer?
Its just a wild though. Could you please take the pain to ponder on it?
Thanks & Regards
same thing i want to ask.
in order to maintain the uniformity of threads, we maintain a special node called the header node. The header node does not contain any data part and its left link field points to the root node and its right link field points to itself. If this header node is included in the two-way threaded Binary tree then this node becomes the inorder predecessor of the first node and inorder successor of the last node. Now threads of left link fields of the first node and right link fields of the last node will point to the header node.
5 year ago means aap job kar rahe hoge ab...kaha placement hua ??
great video sir plz keep this great work continued...
Sir, thanks for sharing these algos in such a easy manner.. request you to share also algo for tower of honai..??... waiting for it
Excellent explanation! Thank you
Thank You so much for this excellent video sir!
thank u sir very good explanation..need lecture on digital search tree
This was explained so nicely :)
Sir please explain the coding of in order right threaded binary tree, create tree, insert left , insert right
ok smjha dunga.
Great explanation, thanks!
Nice explanation sir
I have an exam tomorrow. I hope this video helps me
Why didn't the null pointer also indicate itself just like the dummy node ?
Explanation amazing 🔥
Thanks to get scoring full mark in data structure
loved your explanation
Will u please prefer a good book of data structure?
sir,excellent explanation.
Sir nahi hai woh mera dost hai
Excellent explanation sir...
Please also explain the programming code in C++. You explain really nice keep working.
i would like to ask,insertion and deletion operation of threaded binary tree implementation.
Awesome explanation.
Awesome explanation sir
u are awesomebruh...thanksfor thiss...
nice explanation! helped a lot
how would you go about doing a pre-order addition to the same binary tree and then traversing it in pre-order? i have already written the code for a in order threaded binary tree as well as the traversal for in order however i cant seem to figure out what the pre-order implementation would look like for adding to a TBT in pre-order especially when you have right children that you need to point to that are on the other side of the tree im currently using 3 pointers to keep track of the nodes as i need them to hold the temporary place within each node i need to point to next.
Nice explanation, But how it is useful from Binary trees? And instead of introducing a dummy node, why cant we set the left and right flag integer as -1 and set the left and right pointer as NULL? so -1 represents NULL.
excellent explanation
Sir
How about making the last node's flag as 1 and keep them null coz that node won't be pointing to any subnode under it
Great explaination sirji
Hi first of all thank you very much for all the videos , can you teach about B trees please?
tq sir......very easy to understand....
spr sir.....sema xplanation
Thank you so much sir. Extremely clear and valuable explanation!
Excellent bro 😊
Good going...
Thank you sir. it's helpful ✌️
Very helpful Sir.
Very thanks sir
I will using that your cls
Nice explanation
why not use booleans to store the left/right flag?
Thanks sir,well explained
Thank u ,😏❤️❤️ explanation 🔥🔥😏
Thank you sir😀😀😀
mast shikavta sir
Will you add a video on insertion in threaded binary tree?
Te amo !
Thank u so much ❤️
Sir, how was the insertion is done in threaded binary tree
Insertion and deletion cases in tbt
Can u please do videos on sparse matrix and its triplet form and transpose
good teach
thanks. nice videos
Please give code for pre order and post order Traversal in threaded binary tree
but I have one doubt that is what is the purpose of dummy node.....why we use TBT. ....instead of binary search tree.....
Very nice
Excellent explanation !
Where can we find the code for TBT?
best explanation sir
bestt🎉
Excellent