|
|
|
This lecture shows three
linked list operations in detail. The operations are:
|
|
1. Adding a new node at the
head of a linked list.
|
|
2. Adding a new node in the
middle of a linked list.
|
|
3. Removing a node from a
linked list.
|
|
The best time for this
lecture is just after the students have been introduced to linked lists
(Section 4.1), and before the complete linked operations have been covered
(Sections 4.2-4.3).
|