CMSC420-0201: Lecture - Shared screen with speaker view
sorry, i just got back. did he ask us to redownload the file for the projects?
Yeah he fixed a toString() method in Airport yesterday
So just update the test class
How do you know which nodes are red and which are black? How did the 8 go from black to red?
Sorry if this has been addressed already, but how did we know that 6 was a red node?
so in the recursive statement, you have a split(skew(p)). How does the tree know to do it as many times as needed?
if there was an exam question, would it be drawing each step or writing a code for it?
When you insert a node, how do you determine whether it's red or black?
someone in bio reinvented calc
I'm not understanding why the priority matters if you just insert one node at a time. Is it the case that you buffer a few insert calls and then randomize that insertion order?
in this example, why do you insert (b,38) left of e and not the right of k?
Its based on the letter, not the priority
Priority just determines the order that they're put in, not where they go
so does the priority only affect the very first insertion?
Why can't you just assign random value