uNotes logouNotes
HomeExploreAppsAddFlashcardsQuizzesChatLecturesMy profileDocsContact and support
PremiumPrivacy and terms
logo
LoginSignup
LectureITI1121 • Introduction to Computing II

ITI 1121 — Linked Lists, Stacks, Queues and Recursion

Singly linked list, the invariants that matter A node holds a value and a reference to the next node; the list holds a reference to head and, usually, a size counter. Two invariants must be maintained by every method: th

T

Talia Brennan

@talia-brennan

Lecture Notes