Great explanations! You really can get a college-level CS education online for free. I could've learned everything you need to know about binary search trees of all sorts in a week with your videos. (I'm in college right now and we are spending much more time than that.)
I really enjoyed this video and the series -- but I wish you had also covered B+Trees and compared them with the B-Tree. If possible, I'm looking forward to watching that!
I appreciate your reply and I will also watch your upcoming videos, but could you already tell me, if it is true or false, because I have a test in 2 days, where I will need this information:)
@@liorio2847 The distinction lies in two main aspects: all leaf nodes are linked together in a doubly-linked list and data is only stored in the leaf nodes and internal nodes only forward you while searching to the correct leaf node. With that said, yes, the insertion and deletion will vary between the two. Hope this helps! Cheers :)
Great video, thanks a lot ! Question - in Wikipedia (en.wikipedia.org/wiki/B-tree ) and in most of the literature, it seems that what you call here leaves (which is here the lowest nodes that carry information) also need to have at least m/2 children - are there different definitions of B-Tree regarding the leaf nodes ?
Glad you liked it! Yes it is not uniform and may differ from person / perspective to another. The link you sent is actually a good reference, you can find your answer under the "Differences in terminology" section. Cheers!
Thank you! Will look into it :) Edit: After checking, I actually did a few tweaks on the audio after uploading this video back then, check this one: czcams.com/video/r8KJ2AJWkHs/video.html and let me know!
@@geekific I think audio settings are not the issue but the mic is, try getting a condenser microphone if you have the budget for it, your current mic sounds "tinny" where the highs are too high with no lows at all. Condenser microphones allow you to get much closer to them and can lead to much "fuller" and cleaner audio. Try looking into microphones that people use for podcasts, oh and go for audio interface + mic instead of usb plug and play, it reduces jitter by a ton.
At around 1:10 we state that 'm' is the maximum number of children a node can have, making 'm-1' the maximum number of keys that can be stored inside a single node.
Hello! In this example we were discussing a b-tree of order 3, which means that every node can have 3 children at most and can store 2 keys. At 5:00, 28 cannot fit next to 22 and 25 in the same node because each node can store a maximum of 2 keys, additionally 28 cannot be an independent child of 20 because as we mentioned in 4:00 when a node has 3 children then it must store 2 keys and if we do that the node storing element 20 will only have a single key, hence why we promoted 25. Hope this answers your question :)
@@geekific The way you speak, especially the way you use a wrong stress of words, sounded just like Linux Experiment (CZcams channel), who is a French.
Wow, I can’t believe how high quality this video/lesson is, you deserve more recognition, very well done
Thanks a lot for your kind words :) Am glad it was helpful!
Most underrated video on youtube
Thanks a lot man :)
This video was incredibly helpful! Thank you for taking the time to upload such quality content.
Glad you enjoyed it! You're most welcome :)
Many think before this video, I had a hazy understanding of promotion and splitting. Thanks for making such a great video.
Thank you so much! I (along with the whole community) will be waiting for the video on the implementation of B-Trees as much time as needed! 😎
You got it! Thanks for the support :)
Super quality lesson. Keep up man I watched 4 videos for like1 hour waste. now only 12mins and easily consumed every info. Great video
Crisp and Clear! Looking forward to the implementation video!
Great explanations! You really can get a college-level CS education online for free. I could've learned everything you need to know about binary search trees of all sorts in a week with your videos. (I'm in college right now and we are spending much more time than that.)
That is exactly why I decided to start this channel, I had the same struggles! Keep it is up and glad I could help :)
Your explanations are very precise. You have a great command of the English language and your accent is pleasing, too.
Yes, I would also love to see the implementation of BTree.
Yes, I would love to see an implementation of BTree.
please do implementation of B trees in java
not only b trees upload other data structure implementations also in java i love it
thank you so much
Best video for understanding B tree and its operations, thank you!
Glad it was helpful!
Amazing video. Really the only one I could actually understand.
Thank you!! Glad I could be of help :)
Amazing video! Thank you so much.
Glad you liked it!
I really enjoyed this video and the series -- but I wish you had also covered B+Trees and compared them with the B-Tree. If possible, I'm looking forward to watching that!
Glad you liked it! Sure no worries, I'll make sure to add it to my list of upcoming videos. Stay Tuned!
best vid on B-trees ive seen
Glad it helped!
Thank you. Pretty simple and understandable.
What an explanation 🙌
This video is terrific 💯💯. Love u guyzz
How do you know the order of a B tree or is this something we decide when building it ?
thanks
@Geekific Without implementation the deletion and traversal was confusing, can you please share the implementation video
Will add it to my list of upcoming videos, Stay tuned!
yes (answer to the question asked in the video)
Thank you, and yes I want b trees implementation in javaa
wow you explain so well!
Super explanation! Thank you!
Glad it was helpful!
well explained video. Rly helpful
Great video! Super simple and usefull
This is too good.
Could you also make it for B+, please ?
Stay Tuned!
i wished there was also implementation of B-Trees
Working on it! Stay Tuned :)
Great video - thank you!
Glad you liked it! My pleasure :)
Saved my day!
Glad it did!
In 8:23 when we removed 1, why did we have to do the rotation, weren't all the B- Tree conditions satisfied?
Node 2 did not have enough children!
Wow❤
Hello, I would like to know if the insertion and deletion of b tree is the same as in the b+ tree?
We will be expanding on this topic in a future video :) Stay Tuned!
I appreciate your reply and I will also watch your upcoming videos, but could you already tell me, if it is true or false, because I have a test in 2 days, where I will need this information:)
@@liorio2847 The distinction lies in two main aspects: all leaf nodes are linked together in a doubly-linked list and data is only stored in the leaf nodes and internal nodes only forward you while searching to the correct leaf node. With that said, yes, the insertion and deletion will vary between the two. Hope this helps! Cheers :)
yes, it helps!:)
Great video, thanks a lot !
Question - in Wikipedia (en.wikipedia.org/wiki/B-tree ) and in most of the literature, it seems that what you call here leaves (which is here the lowest nodes that carry information) also need to have at least m/2 children - are there different definitions of B-Tree regarding the leaf nodes ?
Glad you liked it! Yes it is not uniform and may differ from person / perspective to another. The link you sent is actually a good reference, you can find your answer under the "Differences in terminology" section. Cheers!
Amazing Explanation! You rocked!
Glad you think so!
Hallo ,
Why did we do a balnace when we deleted 1. Was the Tree not balanced ?
Hello, this is to ensure the first property discussed at around 2:40 :)
Why the initial tree is order of 3?
A tree of order 3 is a tree in which a node can have at mode 3 children and 2 values per nodes; and that is exactly the case here!
@@geekific thanks for a prompt answer!
great video but get a better mic or maybe tweak with your audio input settings just some friendly criticism
Thank you! Will look into it :)
Edit: After checking, I actually did a few tweaks on the audio after uploading this video back then, check this one: czcams.com/video/r8KJ2AJWkHs/video.html and let me know!
@@geekific I think audio settings are not the issue but the mic is, try getting a condenser microphone if you have the budget for it, your current mic sounds "tinny" where the highs are too high with no lows at all. Condenser microphones allow you to get much closer to them and can lead to much "fuller" and cleaner audio. Try looking into microphones that people use for podcasts, oh and go for audio interface + mic instead of usb plug and play, it reduces jitter by a ton.
No implementation on this one ?
What is 'm'?
At around 1:10 we state that 'm' is the maximum number of children a node can have, making 'm-1' the maximum number of keys that can be stored inside a single node.
@@geekific are we usually given ‘m’ when creating or using a b-tree?
It depends on the context, however yes most of the time 'm' will be a pre-thing to bare in mind while tackling B-Trees.
Sir Btrees in C++ please
We might in the future extend the channel to include other programming languages! Stay Tuned!
why couldnt we just put 28 as a new child node of 20, because it still has room for one more child
Hello! In this example we were discussing a b-tree of order 3, which means that every node can have 3 children at most and can store 2 keys. At 5:00, 28 cannot fit next to 22 and 25 in the same node because each node can store a maximum of 2 keys, additionally 28 cannot be an independent child of 20 because as we mentioned in 4:00 when a node has 3 children then it must store 2 keys and if we do that the node storing element 20 will only have a single key, hence why we promoted 25. Hope this answers your question :)
Sorry, but the sound is unbearable. Artificially wide stereo with terrbily noisy filtering.
We worked on improving the sound over the months. Watch one of our newest uploads and let me know!
Matter is good but don't use voice effects
Glad it is! Will keep this in mind!
You French?
I do speak Français fluently, but I am not French :)
@@geekific The way you speak, especially the way you use a wrong stress of words, sounded just like Linux Experiment (CZcams channel), who is a French.