Zoom Logo

CMSC420-0201: Lecture - Shared screen with speaker view
Jane Li
11:36
up to what material will the exam cover
Hyen Jeong
12:07
Will we ever go over any kind of graph related data structure?
William Cao
12:54
:)
Jane Li
13:40
is it possible to cut the material for the exam a week before the exam?
Jane Li
13:54
that way we have more time to do hw2 and study?
Hyen Jeong
29:27
does programmer set what M is?
William Cao
29:37
is nChild= M?
Hongyu Tu
42:53
The tree drawing does looks like a truck somehow
Hongyu Tu
43:14
😂
Hongyu Tu
43:31
terminator...
Hyen Jeong
49:03
when do you do merge vs adoption
Hyen Jeong
49:12
seems like both done when two few children
Hyen Jeong
58:42
why did you "split" right after inserting 29?
Arun Dhingra
59:42
wouldn’t the root have 26 and 49 instead of 49 and 26?
Hyen Jeong
59:53
yes!
William Cao
01:00:57
left as an exercise on an exam
Hyen Jeong
01:09:07
why did you do adoption not merge?
William Cao
01:12:49
Next thing there's an A- tree
Hyen Jeong
01:15:17
what does the rightmost external node's "next" point to?
Sahil Dev
01:18:55
Thank you!
Hyen Jeong
01:19:01
Thank you~~~~