Jump to content

User:David Eppstein/Fundamental Data Structures

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 19:14, 18 October 2011 (start new book). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)


Fundamental Data Structures

Introduction
Abstract data type
Data structure
Analysis of algorithms
Amortized analysis
Accounting method
Potential method
Sequences
Array data type
Array data structure
Dynamic array
Linked list
Doubly linked list
Stack (abstract data type)
Queue (abstract data type)
Double-ended queue
Circular buffer
Sets
Priority queues
Dictionaries
Successors and neighbors
Integer and string searching