Singly Linked Lists

Homogeneous Collection of Nodes

• nodes: value part - may or may not be a class
• pointer part - usually a struct (object)
• Need a pointer to list head

Operations

• get node (allocation for node)
• freed node (recovers storage)
• list empty
• retrieve value
• search value
• insert after
• delete after
• place

Initializing heap

  Avail = 1;
  for I = 1 to 499 do
    Node[I]. Next = I + 1;
  Node[500].Next = 0;

Return to CIS 350 Index Page