COMS W3134 Lecture Notes - Lecture 14: Tree Traversal, Abstract Data Type, Binary Search Tree
25 Oct 2016
School
Department
Course
Professor
Document Summary
Announcement: 8 questions on midterm, 1 curve ball question, closed book, no calculators, mixture of short answer problems e. g. big-o runtimes, and avl inserts, write 2 or 3 methods in. Exam runs on the long side, so keep moving if stuck isolation e. g. some sort of recursion on binary tree, and similar but not on binary tree: question 1 is induction proof, don"t forget to read 4. 6. Quick review of textbook chapters: chapter 1, don"t need to know 1. 6, mathematics review. Proof by counterexample (used in hw3: recursion, base cases, design rule, generics & interfaces like we have been using them. That is how it will come up on exam, no specific question on generic: might have to write method with generic, chapter 2, don"t have to worry about 2. 4 examples, chapter 3, entirety of chapter. Enqueue, dequeue operations & if scenario requires them. Should i use stack or queue: arraylist vs linklist based implementation.
