CSC148H1 Study Guide - Midterm Guide: Merge Sort, Init, Linked List
1
CSC148H1 Full Course Notes
Verified Note
1 document
Document Summary
Please read the following guidelines carefully: this examination has 7 questions. Q1 q2 q3 q4 q5 q6 q7 total bonus. It"s been a real pleasure teaching you this term. Page 2 of 14: answer each of the following using brief sentences or point-form. Page 3 of 14 (f) [1] we saw in lecture that radix sort was particularly e cient for sorting integers. Return the number of nodes in tree . if tree . i s _ e m p t y (): 1 def c l e a r _ l i s t ( lst ): """ ( l i n k e d l i s t ) -> n o n e t y p e. Turn lst into an empty linked list . ( that is , remove all items from lst . ) lst = l i n k e d l i s t ([])
