CS 16 Plan for Today, 3/12/2018: Course evaluations Review PA6 solution Abstract data types (ADTs) - based on info hiding e.g., class BankAccount v.1 [10-06.cpp] vs. same interface as v.2 [10-07.cpp] “What” matters, but “how” not so much Linked data structures introduction Defining a list node [nodedef.png] Link nodes to make list [Disp. 13.1] Accessing node data [Disp. 13.2] Adding node to head [Disp. 13.3] Searching for data [Disp. 13.6] Inserting node in middle [Disp. 13.8] Removing a node [Disp. 13.10] Node class ADT, implementation, application [Node.h, Node.cpp, 13-15.cpp] Doubly linked list [Disp. 13.11] Binary tree [Disp. 13.12] Discuss Exam 2 Wednesday, 3/14/2018