User:Donpandix/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
Estructura de datos
- Introduction
- Data structures
- Linked data structure
- Succinct data structure
- Implicit data structure
- Compressed data structure
- Search data structure
- Persistent data structure
- Concurrent data structure
- Abstract data types
- Abstract data type
- List
- Stack
- Queue
- Deque
- Priority queue
- Map
- Bidirectional map
- Multimap
- Set
- Tree
- Arrays
- Array data structure
- Row-major order
- Dope vector
- Iliffe vector
- Dynamic array
- Hashed array tree
- Gap buffer
- Circular buffer
- Sparse array
- Bit array
- Bitboard
- Parallel array
- Lookup table
- Lists
- Linked list
- XOR linked list
- Unrolled linked list
- VList
- Skip list
- Self-organizing list
- Binary trees
- Binary tree
- Binary search tree
- Self-balancing binary search tree
- Tree rotation
- Weight-balanced tree
- Threaded binary tree
- AVL tree
- Red-black tree
- AA tree
- Scapegoat tree
- Splay tree
- T-tree
- Rope
- Top Trees
- Tango tree
- Van Emde Boas tree
- Cartesian tree
- Treap
- B-trees
- B-tree
- B+ tree
- Dancing tree
- 2-3 tree
- 2-3-4 tree
- Queaps
- Fusion tree
- Bx-tree
- Heaps
- Heap
- Binary heap
- Binomial heap
- Fibonacci heap
- 2-3 heap
- Pairing heap
- Beap
- Leftist tree
- Skew heap
- Soft heap
- D-ary heap
- Tries
- Trie
- Radix tree
- Suffix tree
- Suffix array
- Compressed suffix array
- FM-index
- Generalized suffix tree
- B-trie
- Judy array
- Ctrie
- Directed acyclic word graph
- Multiway trees
- Ternary search tree
- And–or tree
- (a,b)-tree
- Link/cut tree
- SPQR tree
- Spaghetti stack
- Disjoint-set data structure
- Space-partitioning trees
- Space partitioning
- Binary space partitioning
- Segment tree
- Interval tree
- Range tree
- Bin
- K-d tree
- Implicit k-d tree
- Min/max kd-tree
- Adaptive k-d tree
- Quadtree
- Octree
- Linear octrees
- Z-order curve
- UB-tree
- R-tree
- R+ tree
- R* tree
- Hilbert R-tree
- X-tree
- Metric tree
- Vp-tree
- BK-tree
- Hashes
- Hash table
- Hash function
- Open addressing
- Lazy deletion
- Linear probing
- Quadratic probing
- Double hashing
- Cuckoo hashing
- Coalesced hashing
- Perfect hash function
- Universal hashing
- Linear hashing
- Extendible hashing
- 2-choice hashing
- Pearson hashing
- Fowler–Noll–Vo hash function
- Bitstate hashing
- Bloom filter
- Locality preserving hashing
- Zobrist hashing
- Rolling hash
- Hash list
- Hash tree
- Prefix hash tree
- Hash trie
- Hash array mapped trie
- Distributed hash table
- Consistent hashing
- Stable hashing
- Koorde
- Graphs
- Graph
- Adjacency list
- Adjacency matrix
- And-inverter graph
- Binary decision diagram
- Binary moment diagram
- Zero-suppressed decision diagram
- Propositional directed acyclic graph
- Graph-structured stack
- Scene graph
- Appendix
- Big O notation
- Amortized analysis
- Locality of reference
- Standard Template Library
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.