Exploring Comp2521 26t1 Week 4 Lecture 2
Exploring Comp2521 26t1 Week 4 Lecture 2 reveals several interesting facts.
- Um the size of the right side um so all right so here we're talking about node three um so the size of the left subree of node 3 is
- I'm going to quickly call my sort function on what did I call it i called it a zero Uh how long is this 0 1
- Uh today's
- This genuinely might be the most people that we've ever had in the
- Give me the They give me the biggest
In-Depth Information on Comp2521 26t1 Week 4 Lecture 2
Okay so let's get started can everyone hear me in the back yep good so welcome back to COM 2521 So what is the in order traverse of this tree Because smaller number has a higher priority so you have to follow the DFS algorithm Has multiple clicks inside also it can have multiple clicks inside also so in this part is all together is a click but
Okay welcome back everyone to
Stay tuned for more updates related to Comp2521 26t1 Week 4 Lecture 2.
