11 - CMPSCI 187 Programming With Data Structures Lecture 11...

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

View Full Document Right Arrow Icon
CMPSCI 187: Programming With Data Structures Lecture 11: Linked Data Structures 3 October 2011
Background image of page 1

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

View Full DocumentRight Arrow Icon
Linked Data Structures • The Basic Idea • Advantages and Disadvantages The Class LinearNode Inserting and Deleting in a Linear Linked List Searching a Linear Linked List
Background image of page 2
The Basic Idea of Linked Data Structures • A Java object can hold any kind of data, including another object of the same class as itself. • Of course this means that some data Feld of the object holds a pointer to another object of the same class. • Suppose we extend the class Dog to a class SledDog which includes a Feld SledDog next , so that if king is a SledDog , then king.next is the dog immediately following King in his sled team. • If King is the lead dog, the other dogs in the team are king.next , king.next.next , king.next.next.next , and so on. Every dog in the team is reachable from King by following pointers.
Background image of page 3

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

View Full DocumentRight Arrow Icon
More Basics of Linked Structures • If we are primarily studying the linkages between data items, we call the individual items nodes , the usual term in mathematics (along with vertices ) for the “dots” in a diagram with dots, lines, and arrows -- a graph . • The sled dog team is a particular kind of structure, where every dog has at most one “next” dog, and in addition every dog has at most one predecessor
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/22/2011 for the course COMPSCI 187 taught by Professor Barrington during the Fall '11 term at UMass (Amherst).

Page1 / 9

11 - CMPSCI 187 Programming With Data Structures Lecture 11...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online