CSC 2110 Lecture Notes - Lecture 20: Linked List, Data Type
11 Apr 2018
School
Department
Course
Professor
Document Summary
A list of item, called nodes, in which the order of the nodes is determined by the address, called the link, stored in each node. Address (link) of the next node in the list. A link list can easily grow or shrink in size. Insertion and deletion of nodes is quicker. A linked list is called linked because each node in the series has a pointer that points to the next node in the list. The address of the first node in the list is stored in a separate location called the head or first. A node is declared as a class or struct. Data type of node depends of the specific application. Link component of each node is a pointer. If data is unsorted, the list will be unsorted. Can build a link list forward or backward. A new node is always inserted at the end of the link list.
