Added: 5 years ago
From: rationalpsychedelia
Views: 114,551
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:
see all

All Comments (82)

Sign In or Sign Up now to post a comment!
  • Very cool, thanks!

  • Comment removed

  • song?>

  • the value of b is 2 right? just checking.

  • @EmmyArts1 No the order is 3 :)

  • must b said, nice music bt wot shud b nice is too fast!!

  • best b-tree ever watched before thanxxx dude

  • Comment removed

  • The deletions aren't very clear, but the rest was great.

  • Hey thanks dude, but the animation could be a little slower.

  • it is actually a 2-3 tree, if I am not mistaken.

  • nyc video bt deletion is goin a bit fast...

  • nyc video bt deletion is goin a bit fast...

  • nyc video bt deletion is too fast..

  • Really annoying music.. especially after you hear it a few times.

  • Good one

  • here is the link to the Applet he used to demonstrate the algorithm. slady(dot)net/java/bt/view(dot­)php?w=800&h=600

  • Btw use h t t p in front and replace (dot) with .

  • thank u

    

  • muito interessante a forma que está sendo exposto o conteúdo, só fica meio confuso no final nos métodos de remoção... =)

  • Until half of video, the insertions are growing order witch shows the efficience of the b-tree algorithm. In a normal binary tree this is worse case, but b-tree remains balanced enough to make any element to be a distance of log( n ) from the root.

  • lol couldnt pay attention to the video, was busy enjoying the song

  • Hey Nice work man.............. It would be easier for the viewer if u would have given the order of the node......... Which the viewer would get a better understanding...... But all in all bravo................

  • this is a 2-3 tree not a B tree

  • @Stro2101 sorry, but a 2-3 tree is for definition a b-tree too!

  • haha good song to put for this.. perfect.

  • NICE VIDEO

  • It is Btree with the order of 3, this means each cannot hold more than two keys , in this case two numbers, other wise the node should be splitted after the third inserted and the middle element will be shifted upwards, while you generating a new node and filling it with that middle element.

  • @Dalwanaage Yes, i also think it's a order of 3! :D

  • thanks man. this helped me out with school

  • what is the app you are doing it ?

  • which order B tree is this 2 nd or 3rd ??????

  • Order p = 3. That's because each node has 3 pointers

  • Also because each node has 2 keys; every node has k-1 keys, where k is the number of pointers or the order of the b-tree

  • Isn't it easier to say that each node has k+1 pointers; where k is the number of keys.

    Or is k always defined as pointers when it comes to b+trees?

  • Its good 4 quick review thnx

  • extensions lecture please.

  • this video is really easy to understand the concept.

    Thanks a lot.

  • whats the name of the song?

  • it's called Nikkfurie - Thé à la menthe. I searched forever to find that once. It's in Ocean's 12.

  • i think its from oceans 13 or 12... something like that right?

  • low quality...

  • Very good presentation of inserting elements in an order 3 B-tree.

  • This clip doesn't really seem to accurately depict what's traditionally considered to be a B-Tree. The actual data is stored in the *leaves* of the tree, while the higher nodes are just keys that direct where to find the data. This example is showing data being stored at all levels. If you're using this animation to study for a CS test, be careful.

  • Very good comment, and decent too!

  • That's not True. The data structure you describe is called B+ tree. So if you want to make smart comments be careful.

  • Aww, I just saw the comment after saying nearly the same. My youtube is bugged and does not display the comment entries in the right way.

  • The data structure you are refering to is call a B+ or sometimes a B* tree.

    The B tree in this video shows a bottom-up version. I just mention that, because I got a bit confused watching the new element moving down the tree to its place and saw that the 2-nodes were not splitting up, as they do in the top-down variation of the B-tree.

  • Great clip, very helpful for clarifying how it works.

  • Всё показано быстро. Без разъяснения. Какие элементы удалялись я не понял. Надеюсь пройти хорошо экзамен по data bases.

  • Translation: everything is shown very quickly, and without explanation. I cannot understand which elements are being deleted. Hoping to do well on my exam.

  • What`s this song called?? :D

  • Comment removed

  • Comment removed

  • thanks..

  • it's order of 1

  • Comment removed

  • greate!!

  • lol a Professor of our University refers to this clip :D

  • abc

  • it was so helpful........thx alot

  • It was helpful? If you don't mind my asking...how so?

  • Thanks,

    BTW, whats the name of song in background?

  • nikkfurie - the ala menthe

  • Thanks,

    Yeah it is..

    La Caution - Thé à la menthe

  • oe no se entiende esta weadaa!! porfe guevara danos el codigo pssss

  • compra un libro en 'data structures' o 'database internals'

  • jajaja perdedor xD

  • Hey, is there any way we could get the source code for this?? (p.s. - Is this in java)

  • I was searching for this, thanks!

  • fabulous!

  • binary tree

    ?

  • no - it's not a binary tree

  • It's binary tree, type of B-tree

  • Actually binary trees are a very specific variant of B-trees, with min and max key number set to 1 for nodes (and 0-1 for root) and two sons. This specific one is a 2nd order B-tree for it has 2 elements at most in a node and three sons.

  • B-tree is a way to store linked data, is used mostly in Computing...

  • what a hell?

  • Wikipedia -> B-tree

  • what is a b tree

  • wiki B-Tree

  • what is this? :-??

Loading...
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more