Select text and it is translated. to AFRIKAANS to ALBANIAN to AMHARIC to ARABIC to ARMENIAN to AZERBAIJANI to BASQUE to BELARUSIAN to BENGALI to BIHARI to BULGARIAN to BURMESE to CATALAN to CHEROKEE to CHINESE CHINESE_SIMPLIFIED CHINESE_TRADITIONAL to CROATIAN to CZECH to DANISH to DHIVEHI to DUTCH to ENGLISH to ESPERANTO to ESTONIAN to FILIPINO to FINNISH to FRENCH to GALICIAN to GEORGIAN to GERMAN to GREEK to GUARANI to GUJARATI to HEBREW to HINDI to HUNGARIAN to ICELANDIC to INDONESIAN to INUKTITUT to ITALIAN to JAPANESE to KANNADA to KAZAKH to KHMER to KOREAN to KURDISH to KYRGYZ to LAOTHIAN to LATVIAN to LITHUANIAN to MACEDONIAN to MALAY to MALAYALAM to MALTESE to MARATHI to MONGOLIAN to NEPALI to NORWEGIAN to ORIYA to PASHTO to PERSIAN to POLISH to PORTUGUESE to PUNJABI to ROMANIAN to RUSSIAN to SANSKRIT to SERBIAN to SINDHI to SINHALESE to SLOVAK to SLOVENIAN to SPANISH to SWAHILI to SWEDISH to TAJIK to TAMIL to TAGALOG to TELUGU to THAI to TIBETAN to TURKISH to UKRAINIAN to URDU to UZBEK to UIGHUR to VIETNAMESE

Category

• Arts
• Biography
• Geography
• History
• Mathematics
• Science
• Society
• Technology
• All portals

List of data structures

This is a list of data structures. For a wider list of terms, see list of terms relating to algorithms and data structures.

Contents

• 1 Base data structures
• 2 Linear data structures
• 3 Non linear data structures
• 4 Comparison

Base data structures

General type Specific types Primitive types

• Character
• Integer
• String
• Double
• Float

Composite types

• Struct
• Bit field
• Union
  • Tagged union
• Gap Buffer

Linear data structures

General type Specific types List(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 types Graph 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
  • Aronszajn tree
    • Suslin 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

Comparison

An attempt to classify data structures based on feature attributes:

Structure Ordered Unique Cells per Node Bag (multiset) no no 1 Setno yes 1 Listyes no 1 Mapno yes 2

"Ordered" does not mean sorted, only that input order is "retained". Other structures such as "linked list" and "stack" cannot easily be defined this way because there are specific operations associated with them.

Categories: Data structures

Link former page on this page

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• http://wikipedia.atpedia.jp/wiki/%E9%BA%BB%E5%A9%86%E8%B1%86%E8%85%90

• http://wikipedia.atpedia.jp/wiki/%E7%94%9F%E4%B9%B3

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

• [[wikipedia@pedia]] 0

Related word on this page

a.k.a  base  Structure  Uniq 

Related Shopping on this page

a.k.a  base  Structure  Uniq