CS234 Final: Final Review
29 Aug 2016
School
Department
Course
Professor
Document Summary
Mc 30 qs a mark each => 35. Writing 8 - 10 questions each 2 marks => 55 ish. No explicit question but answering q you might need to use things from diff places like pre midterm. Is it a binary is it a heap. Complete balance factor and check if avl or not. If bst insert node search key 4 and show steps. If i wanan remove 10 show steps on how to remove 10. We get the same tree in this case because x is a leaf node. Goes to the same spot if t" is the same as t. What if i remove, change the order of inserting and removing. Runnign the examples in class show the steps removing. Or up there on stack post pre fixes. Don"t need to know code for bubble sort. Like worst case where quick sort is n^2. You need to know the run time of algorithms.
