411 REFERENCE · Wikipedia
आंकड़ा संरचनाओं की सूची
Reference material by Wikipedia contributors. This retains its source identity and is not 411 news reporting.
सितंबर 2014
यह आंकड़ा संरचना या डेटा-स्ट्रक्चर की सूची है।
मूल डेटा संरचनाएँ (Base data structures)
सामान्य प्रकार (General type) विशिष्ट प्रकार (Specific types)Primitive types Character
Integer
String
Double
FloatComposite types Struct
Bit field
Union
Tagged union
Gap Buffer
रैखिक डेटा संरचनाएं (Linear data structures)
General type Specific typesList (or vector or sequence) Array
Bitmaps
Images
Heightfields
Dynamic array
Parallel array
Sparse array
Matrix
Sparse matrix
Bitboard Linked list
Unrolled linked list
Xor linked list
Doubly linked list VList Buffer
Stack
Queue
Priority queue
Double-ended priority queue
Deque
Circular buffer Associative array (a.k.a. dictionary or map) Hash table Self-balancing binary search tree Skip list
अरैखिक डेटा संरचनाएं (Non linear data structures)
General type Specific typesGraph data structures Adjacency list
Adjacency matrix
Disjoint-set data structure
Graph-structured stack
Scene graph Tree data structures M-Way Tree
B-tree
2-3 tree
2-3-4 tree
B+ tree
Generalized search tree
B* tree
B# tree
UB tree
R tree
Hilbert R-tree
R+ tree
R* tree
Enfilade K-ary tree
Binary tree
Binary heap
Binary search trees (each tree node compares entire key values)
Self-balancing binary search trees
AVL tree
Dancing tree
Red-black tree
AA tree
Scapegoat tree
Splay tree
Top Trees
Interval tree
Treap
Exponential tree Trie family (each tree node compares a bitslice of key values)
Kd trie
Radix tree
Sparse trie
Hash trie
Suffix tree
Directed Acyclic Word Graph (DAWG)
Generalised suffix tree
van Emde Boas tree Heap
Binary heap
Binomial heap
Fibonacci heap
2-3 heap
Soft heap
Pairing heap
Leftist heap
Treap
Beap
Skew heap Other Search Trees
(a,b) tree
Fusion tree Syntax tree
Abstract syntax tree
Parse tree Space partitioning
Bounding interval hierarchy
Bounding volume hierarchy
BSP tree
Kd tree
Adaptive kd tree
Implicit kd tree
Kdb tree
Octree
Quadtree Other trees
And-or tree
Hash tree
Metric tree
BK tree
Cover tree
M tree
VP tree
Finger tree
2-3 finger tree
AVL finger tree
Non-lazy finger tree Decision theory
Binary decision diagram
Decision tree
Alternating decision tree
Minimax tree
Expectiminimax tree
तुलना
आंकड़ा-संरचनाओं को उनके अन्य गुणों के आधार पर वर्गीकरण का प्रयास।
संरचना (Structure)स्थायी (Stable)अनन्य (Unique)प्रति नोड सेल (Cells per Node)Bag (multiset)नहींनहीं1Setनहींहाँ1Listहाँनहीं1Mapनहींहाँ2
स्थायी का अर्थ है कि इन्पुट का ऑर्डर अपरिवर्तित रहता है। लिंक्ड लिस्ट और स्टैक आदि अन्य संरचनाएं इस तरीके से आसानी से परिभाषित नहीं की जा सकतीं क्योंकि उनके साथ विशिष्ट संक्रियाएं जुड़ी हुई हैं।
सूची, आंकड़ा संरचनाओं की
श्रेणी:डाटा संरचना