User:Baddie rocks/Books/Data Structures
 | The Wikimedia Foundation's book rendering service has been withdrawn. Please upload your Wikipedia book to one of the external rendering services. |
 | You can still create and edit a book design using the Book Creator and upload it to an external rendering service:
|
| This user book is a user-generated collection of Wikipedia articles that can be easily saved, rendered electronically, and ordered as a printed book. If you are the creator of this book and need help, see Help:Books (general tips) and WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ] | ||||||||
Data Structures[edit]
- Data structure
- List of data structures
- Anatree
- Array data structure
- Collection (abstract data type)
- Compressed data structure
- Concurrent data structure
- Container (abstract data type)
- Data descriptor
- Device tree
- Disjoint-set data structure
- Disruptor (software pattern)
- Doubly linked face list
- Dynamization
- Finger search
- I/O request packet
- Implicit data structure
- Java collections framework
- Key-independent optimality
- Linked data structure
- Order-maintenance problem
- Partition refinement
- Persistent data structure
- Piece table
- Process Environment Block
- Processor Control Region
- Randomized meldable heap
- Recordset
- Retroactive data structures
- Search data structure
- Search tree
- Sequential access
- Serialization
- Sorted array
- Spaghetti stack
- Succinct data structure
- Symbol table
- Synonym (database)
- System Service Descriptor Table
- System Service Dispatch Table
- Wavelet Tree
- Weak array
- Zipper (data structure)
- List of terms relating to algorithms and data structures
- Canonical cover
- Data normalization
- Dictionary of Algorithms and Data Structures
- Equation-free modeling
- B-tree
- Multimap
- Associative array
- List (abstract data type)
- Set (abstract data type)
- Double-ended queue
- Stack (abstract data type)
- String (computer science)
- Tree (data structure)
- Graph (abstract data type)
- Priority queue
- Queue (abstract data type)
- Union type
- Record (computer science)
- Array data type
- Tagged union
- Plain old data structure
- Suffix tree
- Trie
- Suffix array
- Compressed suffix array
- FM-index
- Generalized suffix tree
- Ctrie
- Y-fast trie
- X-fast trie
- Judy array
- B-trie
- Adjacency list
- Adjacency matrix
- Graph-structured stack
- Scene graph
- Binary decision diagram
- Zero-suppressed decision diagram
- And-inverter graph
- Directed graph
- Directed acyclic graph
- Propositional directed acyclic graph
- Multigraph
- Hypergraph
- Bloom filter
- Distributed hash table
- Hash array mapped trie
- Hash list
- Hash table
- Hash tree (persistent data structure)
- Hash trie
- Koorde
- Prefix hash tree
- Binary space partitioning
- Binary heap
- AA tree
- AVL tree
- Binary search tree
- Cartesian tree
- Pagoda (data structure)
- Red–black tree
- Rope (data structure)
- Scapegoat tree
- Self-balancing binary search tree
- Splay tree
- T-tree
- Tango tree
- Threaded binary tree
- Top tree
- Treap
- Weight-balanced tree
- 2–3 tree
- 2–3–4 tree
- Dancing tree
- B+ tree
- Queap
- Fusion tree
- Bx-tree
- Doubly linked list
- Linked list
- Self-organizing list
- Skip list
- Unrolled linked list
- VList
- XOR linked list
- Doubly connected edge list
- Heap (data structure)
- Binomial heap
- Fibonacci heap
- AF-heap
- 2–3 heap
- Soft heap
- Pairing heap
- Leftist tree
- Beap
- Skew heap
- D-ary heap
- Bidirectional map
- Bit array
- Bit field
- Bitboard
- Bitmap
- Circular buffer
- Control table
- Digital image
- Dynamic array
- Gap buffer
- Hashed array tree
- Heightmap
- Parallel array
- Sparse array
- Sparse matrix
- Iliffe vector
- Variable-length array
- Lookup table
- Matrix (mathematics)