Learning objectives
(HL) Explain what an abstract data type is, a set of values and operations specified independently of any implementation, and why separating interface from implementation helps programmers
(HL) Evaluate singly, doubly and circular linked lists against arrays, considering dynamic size, the cost of insertion and deletion, sequential access and the memory used by references
(HL) Sketch diagrams that show how nodes and references change when a node is inserted, deleted or found, and when a list is traversed
(HL) Construct node classes and code that insert, delete, traverse and search singly, doubly and circular linked lists
Continue with a revision plan
These learning objectives are available to everyone. Sign in with an eligible plan to read the full note and worked examples.