Great video! Thanks so much. Please make a full length video on each of them with solving the leetcode problems associated with each of them inside each of those videos. It would be of great help. Thanks so much! Great explanation!
They might be the same, but not sure. On Wiki it says, "B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time."
@@AlgosWithMichael Great video! But I'm pretty sure your b-tree explanation is misleading. The crucial difference between a b-tree and a binary tree is the branching factor. As you pointed out, binary trees have a branching factor of two but a b-tree could have an arbitrarily large branching factor (several hundred). The most important difference though, is that if the branching factor is B, lookups in a binary tree are log2(n) and lookups in a Btree are logB(n). So when n is a billion, you'd have to traverse ~30 nodes to find a value in a binary tree vs ~4 nodes to find a value in a b-tree with a branching factor of 100. This difference becomes material when your tree is stored on disk. 30 disk seeks on a spinning disk could be 5 - 30ms, whereas four disk seeks would be < 4ms. That's why b-trees are used when storing stuff on disk: to minimise the number of disk seeks. Otherwise, any other self-balancing tree would be fine. There are loads of other interesting properties of btrees in this pretty accessible paper: carlosproal.com/ir/papers/p121-comer.pdf . If you make a video about Btrees specifically I'll upvote the crap out of it! Thanks for all your work! Your presentation style is awesome =)
@@AlgosWithMichael An AVL tree is a self-balancing tree. It is a binary search tree in which every node keeps a record of the difference in height between the height of the right tree and the left tree. If the difference is greater than a threshold, then you perform a right-left, right-right, left-right or a left-left rotation. After performing a rotation the tree is balanced. It was noted that the AVL trees are faster than Red-Black trees (used in TreeMap).
Awesome video bro. Keep cranking out these quality videos and your channel's gonna blow up for sure.
Thank you so much!
Awesome video man. Would love an in-depth video on each data structure very much. Thanks again for the videos.
Noted! Thanks for watching
Thanlks a lot, great video!
could you please tell where is a source for studying all of Algorithms and Datastruces?
Incredible. What do you use for your slides and animations?
I use an editing software called Camtasia
Fascinating!!! would you please make a in depth video on each of them? Keen to dive in
Yes definitely!
Great video! Thanks so much. Please make a full length video on each of them with solving the leetcode problems associated with each of them inside each of those videos. It would be of great help. Thanks so much! Great explanation!
Should not the a in cobra be a referrence to an existing a from cat ?
More on Disjoint Set, Skip List please.
Definitely!
It is amazing video bro. Thanks. Please do more videos on Union Find and Topological Sorting Algorithms.
ah so that's what a trie is
props to my teacher for asking us to implement it before explaining how it works
lol teachers be like that sometimes
great work !!!!
Wonderful as ever!
Thank you!
I have a doubt regarding the last one. Isn't R & B tree and AVL tree self balancing one? Are they same as B-Tree?
They might be the same, but not sure. On Wiki it says, "B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time."
@@AlgosWithMichael Great video! But I'm pretty sure your b-tree explanation is misleading. The crucial difference between a b-tree and a binary tree is the branching factor. As you pointed out, binary trees have a branching factor of two but a b-tree could have an arbitrarily large branching factor (several hundred). The most important difference though, is that if the branching factor is B, lookups in a binary tree are log2(n) and lookups in a Btree are logB(n). So when n is a billion, you'd have to traverse ~30 nodes to find a value in a binary tree vs ~4 nodes to find a value in a b-tree with a branching factor of 100.
This difference becomes material when your tree is stored on disk. 30 disk seeks on a spinning disk could be 5 - 30ms, whereas four disk seeks would be < 4ms. That's why b-trees are used when storing stuff on disk: to minimise the number of disk seeks. Otherwise, any other self-balancing tree would be fine.
There are loads of other interesting properties of btrees in this pretty accessible paper: carlosproal.com/ir/papers/p121-comer.pdf . If you make a video about Btrees specifically I'll upvote the crap out of it!
Thanks for all your work! Your presentation style is awesome =)
Good explanation. Yea, I could have gone further into the order of a B-tree and the key uses. Thanks for the feedback, I appreciate it!
@@AlgosWithMichael An AVL tree is a self-balancing tree. It is a binary search tree in which every node keeps a record of the difference in height between the height of the right tree and the left tree. If the difference is greater than a threshold, then you perform a right-left, right-right, left-right or a left-left rotation. After performing a rotation the tree is balanced. It was noted that the AVL trees are faster than Red-Black trees (used in TreeMap).
awesome
Implementation of Skip List Plz
Yea, that video is on the horizon
Actually you deserve more views,likes and comments...
Thank you, I really appreciate that!
bless you T_T
👍
I kind of brute forced Amazon's Hackerranck question by using hashmap... then I saw disjoint set, and I realized it was a better way