User:Netcse/Books/List of 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 ] | ||||||||
List of Data Structures
Wikibook Creator
- Data structure
- Search data structure
- Primitive data type
- Boolean data type
- Character (computing)
- IEEE floating point
- Double-precision floating-point format
- Integer (computer science)
- Enumerated type
- Plain old data structure
- Array data type
- Record (computer science)
- Union type
- Tagged union
- Variant type
- Abstract data type
- Container (abstract data type)
- Associative array
- Multimap
- List (abstract data type)
- Set (abstract data type)
- Priority queue
- Queue (abstract data type)
- Double-ended queue
- Stack (abstract data type)
- String (computer science)
- Graph (abstract data type)
- Array data structure
- Bidirectional map
- Bit array
- Bit field
- Bitboard
- Bitmap
- Circular buffer
- Control table
- System image
- Dynamic array
- Gap buffer
- Hashed array tree
- Heightmap
- Lookup table
- Matrix (mathematics)
- Parallel array
- Sorted array
- Sparse array
- Sparse matrix
- Iliffe vector
- Variable-length array
- Doubly linked list
- Linked list
- Self-organizing list
- Skip list
- Unrolled linked list
- VList
- XOR linked list
- Zipper (data structure)
- Doubly connected edge list
- Difference list
- AA tree
- AVL tree
- Binary search tree
- Binary tree
- Cartesian tree
- Pagoda (data structure)
- Treap
- Red–black tree
- Rope (data structure)
- Scapegoat tree
- Self-balancing binary search tree
- Splay tree
- T-tree
- Tango tree
- Threaded binary tree
- Top tree
- Weight-balanced tree
- B-tree
- B+ tree
- Dancing tree
- 2–3 tree
- 2–3–4 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
- Beap
- Skew heap
- D-ary heap
- Brodal queue
- Tree (data structure)
- Radix tree
- Suffix tree
- Suffix array
- Compressed suffix array
- FM-index
- Generalized suffix tree
- Judy array
- C-treeACE
- Ternary tree
- K-ary tree
- And–or 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
- Space partitioning
- 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
- Vantage-point tree
- BK-tree
- Bounding interval hierarchy
- Rapidly exploring random tree
- Abstract syntax tree
- Parse tree
- Decision tree
- Alternating decision tree
- Minimax
- Expectiminimax tree
- Finger tree
- Binary expression tree
- Bloom filter
- Count–min sketch
- Distributed hash table
- Double hashing
- Dynamic perfect hashing
- Hash array mapped trie
- Hash list
- Hash table
- Hash tree
- Hash trie
- Koorde
- Prefix hash tree
- Rolling hash
- MinHash
- Ctrie
- 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
- Symbol table
- Collection (abstract data type)
- Double-ended priority queue
Content Disclaimer
Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.
- The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
- There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
- It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
- Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
- Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.