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.
@sphaerophoria5 күн бұрын
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
@ДмитрийКиселев-е1й1с8 күн бұрын
You can add a check to visualizer that the tree is ordered
@zane_erebos8 күн бұрын
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
@sphaerophoria8 күн бұрын
Don't have a job, but also am not looking. We're in funemployment baybeeeee
@murcielago0078 күн бұрын
what happened to the map/bus stop project?
@sphaerophoria8 күн бұрын
I'm not excited to work on it anymore, so I don't 🤷