CSCA48H3 Lecture Notes - Lecture 7: Linked List, Init, Empty String
15 Feb 2018
School
Department
Course
Professor
Document Summary
Csca48 - lecture 07 - nodes + single linked lists. A linked list is a set of nodes, where each node has two (or sometimes more) attributes. The first attribute a node has is its data: the contents of the node (the information held. The second attribute a node has is its next: a pointer to the next node in the linked list. A linked list is a concrete data structure, whose building block is a node. Here is what a node looks like. Keep in mind that each node points to a new node structured in the same way, except for the last node in the linked list whose next points to none . The first node of a linked list is called the head . The last node of a linked list is called the tail . Remember, the tail node"s next points to none .
