User:Ragasvnvs/Books/DSList

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Please select an appropriate cover image for this book. See "Template:Saved book" for instructions."
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
Select format to download:

PDF (A4) · PDF (Letter)

Order a printed copy from these publishers: PediaPress
About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] Recent Changes ]


Primitive data type
Boolean data type
Character (computing)
Floating point
Double-precision floating-point format
Integer (computer science)
Enumerated type
Composite data type
Array data type
Union type
Tagged union
Abstract data type
Container (abstract data type)
Associative array
Multimap
List (abstract data type)
Set (abstract data type)
Priority queue
Stack (abstract data type)
String (computer science)
Tree (data structure)
Graph (abstract data type)
Array data structure
Bidirectional map
Bit array
Bit field
Bitboard
Bitmap
Circular buffer
System image
Dynamic array
Gap buffer
Hashed array tree
Heightmap
Lookup table
Matrix (mathematics)
Parallel array
Sorted array
Sparse array
Sparse matrix
Variable-length array
Doubly linked list
Linked list
Skip list
Unrolled linked list
VList
XOR linked list
Zipper (data structure)
Doubly connected edge list
AVL tree
Binary tree
Order statistic tree
Pagoda (data structure)
Red–black tree
Scapegoat tree
Self-balancing binary search tree
Splay tree
T-tree
Tango tree
Top tree
Treap
Weight-balanced tree
B-tree
Dancing tree
2–3 tree
Queap
Fusion tree
Bx-tree
Heap (data structure)
Binary heap
Binomial heap
Fibonacci heap
AF-heap
2–3 heap
Soft heap
Pairing heap
Leftist tree
Skew heap
D-ary heap
Brodal queue
Trie
Radix tree
Suffix tree
Suffix array
Compressed suffix array
FM-index
B-trie
Judy array
X-fast trie
Y-fast trie
Ctrie
Ternary tree
K-ary tree
(a,b)-tree
Link/cut tree
SPQR tree
Spaghetti stack
Disjoint-set data structure
Enfilade (Xanadu)
Exponential tree
Fenwick tree
Van Emde Boas tree
Rose tree
Segment tree
Interval tree
Range tree
Bin (computational geometry)
K-d tree
Implicit k-d tree
Min/max kd-tree
Adaptive k-d tree
Quadtree
Octree
Linear octree
Z-order curve
UB-tree
R-tree
R+ tree
R* tree
Hilbert R-tree
X-tree
Metric tree
Cover tree
M-tree
BK-tree
Bounding interval hierarchy
Rapidly exploring random tree
Abstract syntax tree
Parse tree
Alternating decision tree
Minimax
Finger tree
Bloom filter
Distributed hash table
Double hashing
Hash array mapped trie
Hash list
Hash tree
Hash trie
Prefix hash tree
Rolling hash
MinHash
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
Lightmap
Winged edge
Quad-edge
Routing table