{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Midterm Review1.7 - Singly Linked List 3.2 A singly linked...

Info icon This preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Last Updated: 1/7/10 10:14 AM CSE 2011 Prof. J. Elder - 31 - Singly Linked List (§ 3.2) ± A singly linked list is a concrete data structure consisting of a sequence of nodes ± Each node stores ² element ² link to the next node next elem node A B C D ±
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Last Updated: 1/7/10 10:14 AM CSE 2011 Prof. J. Elder - 32 - Running Time ± Adding at the head is O(1) ± Removing at the head is O(1) ± How about tail operations?
Image of page 2
Last Updated: 1/7/10 10:14 AM CSE 2011 Prof. J. Elder - 33 - Doubly Linked List ± Doubly-linked lists allow more flexible list management (constant
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon