next up previous contents
Next: 1.2 Mathematical Background Up: 1. Introduction Previous: 1. Introduction   Contents

Subsections


1.1 Interfaces

In discussing data structures, it is important to understand the difference between a data structure's interface and its implementation. An interface describes what a data structure does, while an implementation describes how the data structure does it.

An interface, sometimes also called an abstract data type, defines the set of operations supported by a data structure and the semantics, or meaning, of those operations. An interface tells us nothing about how the data structure implements these operations, it only provides the list of supported operations along with specifications about what types of arguments each operation accepts and the value returned by each operation.

A data structure implementation on the other hand, includes the internal representation of the data structure as well as the definitions of the algorithms that implement the operations supported by the data structure. Thus, there can be many implementations of a single interface. For example, in , we will see implementations of the $ \mathtt{List}$ interface using arrays and in we will see implementations of the $ \mathtt{List}$ interface using pointer-based data structures. Each implements the same interface, $ \mathtt{List}$, but in different ways.

1.1.1 The $ \mathtt{Queue}$, $ \mathtt{Stack}$, and $ \mathtt{Deque}$ Interfaces

The $ \mathtt{Queue}$ interface represents a collection of elements to which we can add elements and remove the next element. More precisely, the operations supported by the $ \mathtt{Queue}$ interface are

Notice that the $ \mathtt{remove()}$ operation takes no argument. The $ \mathtt{Queue}$'s queueing discipline decides which element should be removed. There are many possible queueing disciplines, the most common of which include FIFO, priority, and LIFO.

A FIFO (first-in-first-out) $ \mathtt{Queue}$ removes items in the same order they were added, much in the same way a queue (or line-up) works when checking out at a cash register in a grocery store.

A priority $ \mathtt{Queue}$ always removes the smallest element from the $ \mathtt{Queue}$, breaking ties arbitrarily. This is similar to the way many airlines manage upgrades to the business class on their flights. When a business-class seat becomes available it is given to the most important customer waiting on an upgrade.

A very common queueing discipline is the LIFO (last-in-first-out) discipline. In a LIFO Queue, the most recently added element is the next one removed. This is best visualized in terms of a stack of plates; plates are placed on the top of the stack and also removed from the top of the stack. This structure is so common that it gets its own name: $ \mathtt{Stack}$. Often, when discussing a $ \mathtt{Stack}$, the names of $ \mathtt{add(x)}$ and $ \mathtt{remove()}$ are changed to $ \mathtt{push(x)}$ and $ \mathtt{pop()}$; this is to avoid confusing the LIFO and FIFO queueing disciplines.

A $ \mathtt{Deque}$ is a generalization of both the FIFO $ \mathtt{Queue}$ and LIFO $ \mathtt{Queue}$ ( $ \mathtt{Stack}$). A $ \mathtt{Deque}$ represents a sequence of elements, with a front and a back. Elements can be added at the front of the sequence or the back of the sequence. The names of the operations on a $ \mathtt{Deque}$ are self-explanatory: $ \mathtt{addFirst(x)}$, $ \mathtt{removeFirst()}$, $ \mathtt{addLast(x)}$, and $ \mathtt{removeLast()}$. Notice that a $ \mathtt{Stack}$ can be implemented using only $ \mathtt{addFirst(x)}$ and $ \mathtt{removeFirst()}$ while a FIFO $ \mathtt{Queue}$ can be implemented using only $ \mathtt{addLast(x)}$ and $ \mathtt{removeFirst()}$.

1.1.2 The $ \mathtt{List}$ Interface: Linear Sequences

This book will talk very little about the FIFO $ \mathtt{Queue}$, $ \mathtt{Stack}$, or $ \mathtt{Deque}$ interfaces. This is because these interfaces are subsumed by the $ \mathtt{List}$ interface. A $ \mathtt{List}$ represents a sequence, $ \ensuremath{\mathtt{x}}_0,\ldots,\ensuremath{\mathtt{x}}_{\ensuremath{\mathtt{n}}-1}$, of values. The $ \mathtt{List}$ interface includes the following operations:

  1. $ \mathtt{size()}$: return $ \mathtt{n}$, the length of the list
  2. $ \mathtt{get(i)}$: return the value $ \ensuremath{\mathtt{x}}_{\ensuremath{\mathtt{i}}}$
  3. $ \mathtt{set(i,x)}$: set the value of $ \ensuremath{\mathtt{x}}_{\ensuremath{\mathtt{i}}}$ equal to $ \mathtt{x}$
  4. $ \mathtt{add(i,x)}$: add $ \mathtt{x}$ at position $ \mathtt{i}$, displacing $ \ensuremath{\mathtt{x}}_{\ensuremath{\mathtt{i}}},\ldots,\ensuremath{\mathtt{x}}_{\ensuremath{\mathtt{n}}-1}$;
    Set $ \ensuremath{\mathtt{x}}_{j+1}=\ensuremath{\mathtt{x}}_j$, for all $ j\in\{\ensuremath{\mathtt{n}}-1,\ldots,\ensuremath{\mathtt{i}}\}$, increment $ \mathtt{n}$, and set $ \ensuremath{\mathtt{x}}_i=\ensuremath{\mathtt{x}}$
  5. $ \mathtt{remove(i)}$ remove the value $ \ensuremath{\mathtt{x}}_{\ensuremath{\mathtt{i}}}$, displacing $ \ensuremath{\mathtt{x}}_{\ensuremath{\mathtt{i+1}}},\ldots,\ensuremath{\mathtt{x}}_{\ensuremath{\mathtt{n}}-1}$;
    Set $ \ensuremath{\mathtt{x}}_{j}=\ensuremath{\mathtt{x}}_{j+1}$, for all $ j\in\{\ensuremath{\mathtt{i}},\ldots,\ensuremath{\mathtt{n}}-2\}$ and decrement $ \mathtt{n}$
Notice that these operations are easily sufficient to implement the $ \mathtt{Deque}$ interface:
$\displaystyle \ensuremath{\mathtt{addFirst(x)}}$ $\displaystyle \Rightarrow$ $\displaystyle \ensuremath{\mathtt{add(0,x)}}$  
$\displaystyle \ensuremath{\mathtt{removeFirst(x)}}$ $\displaystyle \Rightarrow$ $\displaystyle \ensuremath{\mathtt{remove(0)}}$  
$\displaystyle \ensuremath{\mathtt{addLast(x)}}$ $\displaystyle \Rightarrow$ $\displaystyle \ensuremath{\mathtt{add(size(),x)}}$  
$\displaystyle \ensuremath{\mathtt{removeLast(x)}}$ $\displaystyle \Rightarrow$ $\displaystyle \ensuremath{\mathtt{remove(size()-1)}}$  

Although we will normally not discuss the $ \mathtt{Stack}$, $ \mathtt{Deque}$ and FIFO $ \mathtt{Queue}$ interfaces very often in subsequent chapters, the terms $ \mathtt{Stack}$ and $ \mathtt{Deque}$ are sometimes used in the names of data structures that implement the $ \mathtt{List}$ interface. When this happens, it is to highlight the fact that these data structures can be used to implement the $ \mathtt{Stack}$ or $ \mathtt{Deque}$ interface very efficiently. For example, the $ \mathtt{ArrayDeque}$ class is an implementation of the $ \mathtt{List}$ interface that can implement the $ \mathtt{Deque}$ operations in constant (amortized) time per operation.

1.1.3 The $ \mathtt{USet}$ Interface: Unordered Sets

The $ \mathtt{USet}$ interface represents an unordered set of elements. This is a set in the mathematical sense. A $ \mathtt{USet}$ contains $ \mathtt{n}$ distinct elements; no element appears more than once; the elements are in no specific order. A $ \mathtt{USet}$ supports the following operations:

  1. $ \mathtt{size()}$: return the number, $ \mathtt{n}$, of elements in the set
  2. $ \mathtt{add(x)}$: add the element $ \mathtt{x}$ to the set if not already present;
    Add $ \mathtt{x}$ to the set provided that there is no element $ \mathtt{y}$ in the set such that $ \mathtt{x}$ equals $ \mathtt{y}$. Return $ \mathtt{true}$ if $ \mathtt{x}$ was added to the set and $ \mathtt{false}$ otherwise.
  3. $ \mathtt{remove(x)}$: remove $ \mathtt{x}$ from the set;
    Find an element $ \mathtt{y}$ in the set such that $ \mathtt{x}$ equals $ \mathtt{y}$ and remove $ \mathtt{y}$. Return $ \mathtt{y}$, or $ \mathtt{null}$ if no such element exists.
  4. $ \mathtt{find(x)}$: find $ \mathtt{x}$ in the set if it exists;
    Find an element $ \mathtt{y}$ in the set such that $ \mathtt{y}$ equals $ \mathtt{x}$. Return $ \mathtt{y}$, or $ \mathtt{null}$ if no such element exists.

These definitions are a bit fussy about distinguishing $ \mathtt{x}$, the element we are removing or finding, from $ \mathtt{y}$, the element we remove or find. This is because $ \mathtt{x}$ and $ \mathtt{y}$ might actually be distinct objects that are nevertheless treated as equal. This is a very useful distinction since it allows for the creation of dictionaries or maps that map keys onto values. This is done by creating a compound object called a $ \mathtt{Pair}$ that contains a key and a value. Two $ \mathtt{Pair}$s are treated as equal if their keys are equal. By storing $ \mathtt{Pair}$s in a $ \mathtt{USet}$, we can find the value associated with any key $ \mathtt{k}$ by creating a $ \mathtt{Pair}$, $ \mathtt{x}$, with key $ \mathtt{k}$ and using the $ \mathtt{find(x)}$ method.


1.1.4 The $ \mathtt{SSet}$ Interface: Sorted Sets

The $ \mathtt{SSet}$ interface represents a sorted set of elements. An $ \mathtt{SSet}$ stores elements from some total order, so that any two elements $ \mathtt{x}$ and $ \mathtt{y}$ can be compared. In code examples, this will be done with a method called $ \mathtt{compare(x,y)}$ in which

$\displaystyle \ensuremath{\mathtt{compare(x,y)}} \begin{cases} {}<0 & \text{... ...{}=0 & \text{if $\ensuremath{\mathtt{x}}=\ensuremath{\mathtt{y}}$} \end{cases}$

An $ \mathtt{SSet}$ supports the $ \mathtt{size()}$, $ \mathtt{add(x)}$, and $ \mathtt{remove(x)}$ methods with exactly the same semantics as in the $ \mathtt{USet}$ interface. The difference between a $ \mathtt{USet}$ and an $ \mathtt{SSet}$ is in the $ \mathtt{find(x)}$ method:
  1. $ \mathtt{find(x)}$: locate $ \mathtt{x}$ in the sorted set;
    Find the smallest element $ \mathtt{y}$ in the set such that $ \ensuremath{\mathtt{y}} > \ensuremath{\mathtt{x}}$. Return $ \mathtt{y}$ or $ \mathtt{null}$ if no such element exists.

This version of the $ \mathtt{find(x)}$ operation is sometimes referred to as a successor search. It differs in a fundamental way from $ \mathtt{USet.find(x)}$ since it returns a meaningful result even when there is no element in the set that is equal to $ \mathtt{x}$.

The distinction between the $ \mathtt{USet}$ and $ \mathtt{SSet}$ $ \mathtt{find(x)}$ operations is very important and is very often missed. The extra functionality provided by an $ \mathtt{SSet}$ usually comes with a price that includes both a larger running time and a higher implementation complexity. For example, the $ \mathtt{SSet}$ implementations discussed in this book all have $ \mathtt{find(x)}$ operations with running times that are at least logarithmic in the size of the set. On the other hand, the implementation of a $ \mathtt{USet}$ as a $ \mathtt{ChainedHashTable}$ in has a $ \mathtt{find(x)}$ operation that runs in constant expected time. When choosing which of these structures to use, one should always use a $ \mathtt{USet}$ unless the extra functionality offered by an $ \mathtt{SSet}$ is really needed.

next up previous contents
Next: 1.2 Mathematical Background Up: 1. Introduction Previous: 1. Introduction   Contents
opendatastructures.org