Exploring Comp2521 26t2 Week 3 Lecture 2
Let's dive into the details surrounding Comp2521 26t2 Week 3 Lecture 2.
- Okay first item is 19 last one is 13 meet 0 1
- The missing start of this
- 3
- Okay we want to sort it ascending from smaller number to the larger number first we need to know the index 0 1
- Uh I think this is the last thing yeah this one I just uh say this helper function is actually then we will discuss in uh
In-Depth Information on Comp2521 26t2 Week 3 Lecture 2
It can continue like this Is the height is like n Did Chad like my call to action yeah but I have to send Like a index so we have to keep track of uh the we using the index like a 0 1 COMP2521 26T2 Week 4 Lecture 1
Son um yeah it's a leading a binary tree yeah that is easier done with recursion yeah we'll look at that in
That wraps up our extensive overview of Comp2521 26t2 Week 3 Lecture 2.