Zoom Logo

CMSC420-0201: Lecture - Shared screen with speaker view
James Brunner
06:45
I love trees :)
Chandan Murthy
11:31
go to r/trees for fun tree facts :)
Alvaro Szigethi Marcos
15:30
They’re like 3 tuples, where the first element is the row, second is the column and third is the value
Hyen Jeong
20:14
to clarify, acyclic = no cycle right?
Sonya Radichkova
20:20
yep
Eric Li
27:26
Generally, in graphs, does degree mean the number of edges incident to the node?
Hyen Jeong
39:43
binary tree isn't necessarily ordered???]\
James Brunner
39:44
It has <= 2 children
Russell Schwartz
40:01
O - O - O - O
Alvaro Szigethi Marcos
40:21
what was the question
William Cao
40:28
doesn't have to be degree 2
Samantha Tang
40:39
Fill left first
Russell Schwartz
40:44
Every node has <= 2 children (so it might be called a binary tree) but it has degree 1
Hyen Jeong
40:50
no
Sonya Radichkova
40:51
Specify left vs right children if there’s only one child?
Bailey Fokin
40:58
im guessing they aren't the same binary tree
Bailey Fokin
43:29
did the prof freeze?
William Cao
43:31
yeah
William Cao
43:35
I think so
Sonya Radichkova
43:40
It froze for me too
Chandan Murthy
43:40
yes
Chandan Murthy
44:23
Is a tree with just one node a full tree?
Tuan Le
44:29
how is that tree full? D only has 1 child
Sonya Radichkova
44:40
D doesn’t in the full diagram
Chandan Murthy
45:26
yes thanks
Russell Schwartz
52:45
http://www.cs.umd.edu/class/fall2020/cmsc420-0201/Lects/lect03-trees.pdf -> 404 :(
Bailey Fokin
52:58
https://www.cs.umd.edu/class/fall2020/cmsc420-0201/Lects/lect03-trees-slides.pdf
Hyen Jeong
53:00
true
Kamtochukwu Okafor
53:01
Error accessing lec notes
Bailey Fokin
53:08
works for me :https://www.cs.umd.edu/class/fall2020/cmsc420-0201/Lects/lect03-trees-slides.pdf
William Cao
53:11
works
Kevin Boby
53:23
https://www.cs.umd.edu/class/fall2020/cmsc420-0201/Lects/lect03-trees-slides.pdf
Kevin Boby
53:25
Use this one
Hyen Jeong
54:57
yaay
Sharon Halevi
58:21
Froze again
Sonya Radichkova
58:24
It froze again for me :(
Sonya Radichkova
58:27
Yep lol
Bailey Fokin
58:28
frozen
Alvaro Szigethi Marcos
58:34
it froze to me when you said “is there a reason to do different types of processing"
Hyen Jeong
01:00:19
so preorder is "root first" right
Sonya Radichkova
01:00:26
yes
Hyen Jeong
01:00:29
just want to make sure
Alvaro Szigethi Marcos
01:00:59
Pre: /*+abc-de
Jacqueline Gao
01:01:26
I like to think of it as the name indicates when the root is visited. pre = before everything else, in = in the middle, post = after you visit left and right
Alvaro Szigethi Marcos
01:04:09
^
Hyen Jeong
01:07:37
so external nodes are where the information are stored?
Chandan Murthy
01:09:36
how do the internal and external nodes correspond? for example which external node represents the root data
James Brunner
01:14:06
Do the non dotted lines even exist as a connection? or would the connection between d and a still exist?
James Brunner
01:14:46
Gotcha thank you
Sonya Radichkova
01:16:29
Wait implicit what, I didn’t catch that
James Brunner
01:16:36
This would have to be left complete for this to work correct?
Chandan Murthy
01:16:47
it means you don't need to store a left/right pointer
Chandan Murthy
01:16:56
just the data is stored in an array
Hyen Jeong
01:17:38
can we have preorder threaded binary tree
Alvaro Szigethi Marcos
01:17:44
@James, all levels full, and the bottom needs to be filled by putting elements as left as you can
Hyen Jeong
01:17:45
or postorder threaded binary tree
Alvaro Szigethi Marcos
01:17:53
Not sure if that answers your question
Kevin Boby
01:18:41
Thank you professor