Link to another explanation: www.cs.ucr.edu/... Check out my website and like or comment any other tutorials you would like to see! www.applejuicescholars.com
From 7:50 - 8:35, D/P needs to have two children (T4 and some T5) due to the property of 2-3 trees. After the deletion, when you bring over the child T3, that should be a problem since then the bottom right 1-node would have three children.
In 7:43, the node with key D is an single key internal node with only one child, which is not a valid 2-3 tree as far as I understand. Every single key internal node should have at least 2 children.
if i am right and what you say is true two of your examples start as unbalanced 2-3 tree which as you can say can not happen, but aside from that its a nice explanation :)
Dude you have good intentions and thats good, but before you upload a video, make sure its not full of mistakes
the above example is nt correct! hw cn 65 be in between 70,90
From 7:50 - 8:35, D/P needs to have two children (T4 and some T5) due to the property of 2-3 trees. After the deletion, when you bring over the child T3, that should be a problem since then the bottom right 1-node would have three children.
I agree with you
In 7:43, the node with key D is an single key internal node with only one child, which is not a valid 2-3 tree as far as I understand. Every single key internal node should have at least 2 children.
@2:30 you're swapping with the inorder successor? Don't you mean inorder PREDECESOR?
either works as we want the element just larger or just smaller than our deleting element
unfortunately your hardcore example was wrong...
But what happens to the childs of L in 2:57 ? S can only have 2 childs but SL contains 3 childs
if i am right and what you say is true two of your examples start as unbalanced 2-3 tree which as you can say can not happen, but aside from that its a nice explanation :)
9:58 root node have just 1 child ... but its wrong .... isnt it?
Thanks for explaining this like this I want more videos about all tq
00:55 S>L??
Unable to understand
10:40 65 can't be in that node because it's less than the lesser of its' parents
he could delete 65 directly..isn't it?
thank you
6:27 hehe, DAB
I am sorry
Please delete this video your giving everyone a wrong idea about the deletion process of 2,4 trees
Dude slow down
This is the worst lecture ever