I've been doing this project along with you and I have found it easier to have the nodes be able to temporarily overflow; where max = 4 the node can hold up-to 5 keys. Inserting returns the node inserted into then you can balance the tree from there. down side is the struct is a bit bigger but not by much.
Yeah that's a good idea. I think eventually this limits speed, as memory is typically the bottleneck. But at this point it probably doesn't matter and your solution makes sense
![Seungmin "그렇게, 천천히, 우리(As we are)" | [Stray Kids : SKZ-PLAYER]](http://i.ytimg.com/vi/kAzmhLHePqU/mqdefault.jpg)
Bob Ross of Zig. Happy Little Paths
I've been doing this project along with you and I have found it easier to have the nodes be able to temporarily overflow; where max = 4 the node can hold up-to 5 keys. Inserting returns the node inserted into then you can balance the tree from there. down side is the struct is a bit bigger but not by much.
Yeah that's a good idea. I think eventually this limits speed, as memory is typically the bottleneck. But at this point it probably doesn't matter and your solution makes sense
You can add a check to visualizer that the tree is ordered
Been watching your channel for a while now and you seem really skilled. I was wondering whether you have a job and if so what it is
Don't have a job, but also am not looking. We're in funemployment baybeeeee
what happened to the map/bus stop project?
I'm not excited to work on it anymore, so I don't 🤷
@@sphaerophoria thats fair