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, 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.
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.
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.
Well, as far as I can understand TBT from Sir's lecture, and wondering about the purpose, I feel by threading we serve the following : 1. We are utilising the NULL Pointers at the extreme ends, for some purpose, instead of wasting it, and using the benefits of Circular Linked List. 2. Similar to Circular List, where we can move from node to node without starting from header node itself, in TBT too, we can move to the root of the subtree, or to the ancester node, without starting from root again. In this vein, we somehow simulate the situation of double linked circular property in a hierarchical data structure. Thus I feel, we can both recursively and non-recursively traverse the tree, without the need of any stack (implicit or explicit) and therein optimizing the space and time complexities associated Thats what I feel and hope that helps. However, Sir is the best judge to comment.
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?
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
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
cant believe i watched this video before,so apparently i forgot all the knowledge,all right this time i will remember ,thank you
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
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
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.........
This tutorial makes mad man to geeks in dataStructures. Excellent
sir... u r excellent in teaching..... u r
very good in teaching....😊👏👏👏👑👑👑👑👑
It is a good way to teach... because of slow teaching is better than the review of video
Thanks alot for providing your knowledge with the future programers of nation
Thankyou sir! This cleared a lot of my doubts!
Wow Amazing explanation. You are a great teacher Sir❤
Sir..please doa video on selection trees,kd trees,leftlist trees and binomial heap...ur explanation is too good to understand..plse sir
Superb sir...tq very much... we have vtu exams on 19 april.... ❤❤❤
Sir, thanks for sharing these algos in such a easy manner.. request you to share also algo for tower of honai..??... waiting for it
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 ??
Sir please explain the coding of in order right threaded binary tree, create tree, insert left , insert right
ok smjha dunga.
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.
Its very clear explanation...i understand verywell...thank you sir
Not all hereos caps ...salute to you sir🙂🙃
Sir your video is most helpful .
best explaination of tbt ..thanks a lot sir
Easy engineering clAses r awesummmmmm...love u sir.....
thankuhh somuch sir ,this content is very helpful for me ...
Very Nice Explanation Sir 🙏🙏
Very beautiful explanation sir.
thank u sir very good explanation..need lecture on digital search tree
Please also explain the programming code in C++. You explain really nice keep working.
Great helpful before exams....
Great explaination sir.
i would like to ask,insertion and deletion operation of threaded binary tree implementation.
superb, thanks it is very useful to every one
Thanks to get scoring full mark in data structure
thank you very much :) amzing explanation
Excellent teaching I found what I needed 🔥👍
Great Explanation. Thanks for your hard work
Nice explanation sir 👍
V detailed and amazing explanation 👍🏻 thanks a lot 😌💗
Exam kaise gaye
Thank You so much for this excellent video sir!
I have an exam tomorrow. I hope this video helps me
Hi first of all thank you very much for all the videos , can you teach about B trees please?
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.
very nice explanation sir🙏🙏🙏🙏
I finally found a video that I can understand. thank you .
great video sir plz keep this great work continued...
Nice explanation sir
Thanks. Your lecture is very easy to understand. I like it! :))
Excellent explanation! Thank you
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
Will you add a video on insertion in threaded binary tree?
Will u please prefer a good book of data structure?
Very thanks sir
I will using that your cls
Wow . Concept clear af 👌
Excellent explanation sir...
Awesome explanation sir
tq sir......very easy to understand....
sir,excellent explanation.
Sir nahi hai woh mera dost hai
This was explained so nicely :)
Great explanation, thanks!
Explanation amazing 🔥
Awesome explanation.
mast shikavta sir
Thanks sir,well explained
Nice explanation
loved your explanation
Can u please do videos on sparse matrix and its triplet form and transpose
Thank you ma'am
Great explaination sirji
Thank u ,😏❤️❤️ explanation 🔥🔥😏
nice explanation! helped a lot
spr sir.....sema xplanation
Thank you sir. it's helpful ✌️
Very helpful Sir.
Excellent
Sir can u make a video on red-black tree
Insertion and deletion cases in tbt
Thank you so much sir. Extremely clear and valuable explanation!
good teach
u are awesomebruh...thanksfor thiss...
thanku so much sirrrr
Thank u so much ❤️
Very nice
Excellent explanation !
Where can we find the code for TBT?
Thank you sir😀😀😀
Good going...
Excellent bro 😊
Why didn't the null pointer also indicate itself just like the dummy node ?
Could you please provide a video on priority queue.. ?
Sir plz explain benefits of TBT Over Simple binary tree
Well, as far as I can understand TBT from Sir's lecture, and wondering about the purpose, I feel by threading we serve the following :
1. We are utilising the NULL Pointers at the extreme ends, for some purpose, instead of wasting it, and using the benefits of Circular Linked List.
2. Similar to Circular List, where we can move from node to node without starting from header node itself, in TBT too, we can move to the root of the subtree, or to the ancester node, without starting from root again. In this vein, we somehow simulate the situation of double linked circular property in a hierarchical data structure.
Thus I feel, we can both recursively and non-recursively traverse the tree, without the need of any stack (implicit or explicit) and therein optimizing the space and time complexities associated
Thats what I feel and hope that helps. However, Sir is the best judge to comment.
Awesome!
Thanks a ton..
bestt🎉
sir, can you please make a video on skiplist
thankyou
Sir, how was the insertion is done in threaded binary tree
Te amo !