CS 2114 Lecture Notes - Lecture 12: Linked List, Popping
29 Mar 2018
School
Department
Course
Professor
Document Summary
Project iii tower of hanoi design is due thursday, march 1 (see rubric at the bottom of the assignment); a standard design will subsequently be released, and the final project is due friday, march 23. Lab vii is take home this week and due friday, march 2. Reading quiz vii will be due after spring break on sunday, march 11. Opendsa homework on recursion is due sunday, march 18 ~ very involved questions and are very important! For a bag adt, we used two different implementations: array and linked nodes. Likewise for a stack, we will consider an array, linked node, and vector implementation. There will be a stack adt interface that defines the required methods. Pay attention to the subtle differences between the labs, carrano data. Recall ~ can only push and pop from the top of a stack. Top entry at the beginning of the chain because it is easy to work with the topnode / headnode.
