List ADT and Implementations

A possible List ADT

• MakeEmpty(List)
• Position Find(List,Element)
• Position FindKth(List,int)
• element ElementAt(List, Position)
• int Size(List)
• InsertElementAfter(List, Position, Element)
• InsertElementBefore(List, Position, Element)
• DeleteElementAt(List,Position)
• DeleteElementAfter(List,Position)
• Position Previous(List,Position)
• Position Next(List,Position)
• Print(List)
• Append(List, List)

Possible List Implementations

• Array
• Two Arrays
• Linked List
• Double Linked List

Array Implementation

#define MAXLEN 50

typedef int Position;

typedef struct {
   Element data[MAXLEN];
   int length;
} List;

Two Array Implementation

#define MAXLEN 50

typedef int Position;

typedef struct {
   Element data[MAXLEN];
   int     next[MAXLEN];
   int length;
   Position first;
   Position last;
   Position free;
} List;

Linked List Implementation

typedef struct node {
   Element data;
   struct node *next;
} *Position;

typedef struct {
   Position first;
   Position last;
   int length;
} List;

Double Linked List Implementation

typedef struct node {
   Element data;
   struct node *next;
   struct node *prev;
} *Position;

typedef struct {
   Position first;
   Position last;
   int length;
} List;

Runtime of List ADT given an Implementation