Zoom Logo

CMSC420-0201: Lecture - Shared screen with speaker view
Bailey Fokin
10:25
sorry, i just got back. did he ask us to redownload the file for the projects?
John Heide
10:46
Yeah he fixed a toString() method in Airport yesterday
Bailey Fokin
10:55
shweet
Kamtochukwu Okafor
12:07
So just update the test class
Kamtochukwu Okafor
12:17
?
Kevin Boby
34:24
How do you know which nodes are red and which are black? How did the 8 go from black to red?
June Xu
34:29
Sorry if this has been addressed already, but how did we know that 6 was a red node?
William Cao
35:20
so in the recursive statement, you have a split(skew(p)). How does the tree know to do it as many times as needed?
Yaeji Shin
59:22
if there was an exam question, would it be drawing each step or writing a code for it?
June Xu
59:38
When you insert a node, how do you determine whether it's red or black?
William Cao
01:08:32
someone in bio reinvented calc
William Cao
01:08:58
biology
Neehar Peri
01:17:23
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?
Jane Li
01:19:47
in this example, why do you insert (b,38) left of e and not the right of k?
Kevin Boby
01:20:03
Its based on the letter, not the priority
Kevin Boby
01:20:13
Priority just determines the order that they're put in, not where they go
Michael Stephanus
01:20:41
so does the priority only affect the very first insertion?
William Cao
01:23:09
Why can't you just assign random value
William Cao
01:23:13
and mergesort?