Singly-Linked List Demonstration Program
A singly-linked list is created and searched as follows.
-
Pointers are maintained to the head and tail of the list.
-
Each node includes a pointer to the next node.
-
A new node is added at the tail of the list.
-
Given a key value, the node containing that key value is searched for.
Source Code of the SList Program
Source Code of the SListG Program (Graphical Version)
Jacob's CS 261 Demos
Jacob's CS 261 Home