Best vidoe

Great video. Do LSM trees next!

Just a great explanation

Are the nodes using pointers to the numbers it has. Cause if that is the case then wouldn't the memory be accessed other times to see the content of the memory address it is pointed?

Obviously, you encode the message with an enigma machine.

Why didn't I find this great channel with unique presentation earlier?

The "monitos" (cute animations) got me engaged to watching, among the interesting information presented/narrated. Great video!🎉😊

wow

1:49 wdym? Never reach negative 1 64 bit limit when you get passed that it will flip back to negative number and eventually reach negative 1 well.. you can't do that with python also depends on architecture

@Spanning Tree This is misinformation. You have to redo this video. How do you choose the position of the insertion in O(1)? The only way, I see with the objective of keeping the tree totally balanced, of choosing the position is by looking at all the leafs which would make the insertion O(n). That is stupid. Insertion has to be done in O(log n).

Insertion is wrong. When inserting, it is always done at the end of the array then the value bobbles up to keep the invariant.

So elegant!

Very cool!

The best video on UKposts. I mean, yes.

May I ask why the smallest number of elements is 2 which we can split into 2,1,2 (at video time 6:00), I think it will be 2,3

The joy of ternary hardware is comparing three keys in one op.

This was such a nice review, thank you

you're videos are extremely helpful. thank you for making these! Also love the robot

Is is awesome thank you

Diffie-Hellman key exchange uses mathematical approach to safely exchange keys (public keys) between two parties

As a non computer science student half thing goes above my mind

awesome, never understood this tree until now. Thanks a lot :)

was it the rigth MSB & LSB??

Excellent content with the cartoon...Sir please do videos of data structure and algorithm in python like this with cartoon

Do more video about data structures, please! Thkx!

Amazing explanation. Appreciate your effort!

sir bghit lik ljna

thanks

Ok but where's the complexity comparison, time and memory complexity gains of b-trees woud have been a nice addition. Nonetheless beautiful animations and you have a great, calm explaining voice

You are a good person.

Thank you for the nice work. I have a small comment, the voice-over does not match the animation when you mention the left and right nodes.

Please keep it up❤

DIKISTRA

So the 'B' in 'B tree' DOES NOT stand for 'Binary'. Definately a chance for confusion there!

the expression was really simple and understandable thank you!

I can't believe I'm back here 😂

I've just started the CS50 AI course as background learning at work, and imagine my surprise to hear this voice again. I really enjoy your teaching style, and I'm so glad to have found more content from you!

Thanks for the vid! You earned my sub

I still don't know why no one has made an encryption schema using recursive fractal patterns as the keys. A seed, a fractal equation and a number of iterations could make a passwordless login system more secure than quantum encryption.

B-trees feels ridiculously easy to understand because of this video 🫡🫡🫡

Beutiful explanation

Imagine deleting one key and then waiting 2 minutes for all the nodes to either merge or split

Wow, that should be the way of teaching in schools n colleges

This is literally the best data structure explanation video I’ve ever seen

Are you planning to do a video like this about TLS? I'd be perfect.

fire vid keep posting, spanning tree!

Best lerning

Mark Zuckerberg teaching me B-Trees, impressive

Brian is that you? I'd recognise that voice from a mile away

I have a question regarding finding data in a B-Tree. Would it not be more efficient to index all the data in the B-tree in a catalog instead of needing to go up and down the B-tree when searching for data? And would that be an alternate process outside of the tree or an internal process which stores the final data within the tree at fast to access nodes?