CSE 15 Lecture Notes - Lecture 13: If And Only If, Asymptote, Linked List
Document Summary
Remember to have a private function called findkey() that does lookup() for you. findkey() does a sequential search down the dictionary. It"s not super difficult, but the operation is something you have to do over and over again, so it"s a prime operation to put in and simplify the code. on delete() Draw pictures to understand what you"re doing to memory. To splice something out of linked list, you need two references, (two hands to pull an object apart in order to insert something else in between) You need to call free(n) if in c. On #1, draw stack horizontally instead of vertically. Boxtrace of #1: the following c program includes a global variable called time. Since it is declared outside of all functions (on line 3), its scope is the entire file. Notice that time is incremented before each of the functions a, b, and c return.
