

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
An explanation of linked lists, including the concept of nodes, insertion at the head, and deletion. It also introduces doubly linked lists and their advantages. Students will learn how to create, insert, and delete nodes in a linked list.
Typology: Study notes
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Object head (^) next (^) Ø Object next Object next Insert here new_node tail
Object head (^) next (^) Ø Object next Object next new_node tail
Object head (^) next (^) Ø Object next Object next new_node^ tail
Object head (^) next (^) Ø Object next Object next head Ø Object next new_node tail tail
head Ø Object next new_node tail Object head (^) next (^) Ø Object next Object next Insert here tail new_node
next (^) Ø
next
next head tail