All pages
Powered by GitBook
1 of 1

Loading...

Data Structures Types

Linear data structures

A data structure is said to be linear if its elements form a sequence.

Arrays[]

Lists

Trees

Main article:

Binary trees

B-trees

Heaps

Trees

In these data structures each tree node compares a bit slice of key values.

Multi-way trees

Space-partitioning trees

These are data structures used for or .

Application-specific trees

Hash-based structures

Graphs

Many -based data structures are used in computer science and related fields:

Other

Bitmap

  • Circular buffer

  • Control table

  • Image

  • Dope vector

  • Dynamic array

  • Gap buffer

  • Hashed array tree

  • Lookup table

  • Matrix

  • Parallel array

  • Sorted array

  • Sparse matrix

  • Iliffe vector

  • Variable-length array

  • Self-organizing list

  • Skip list

  • Unrolled linked list

  • VList

  • Conc-tree list

  • Xor linked list

  • Zipper

  • Doubly connected edge list also known as half-edge

  • Difference list

  • Free list

  • Cartesian tree

  • Conc-tree list

  • Left-child right-sibling binary tree

  • Order statistic tree

  • Pagoda

  • Randomized binary search tree

  • Red–black tree

  • Rope

  • Scapegoat tree

  • Self-balancing binary search tree

  • Splay tree

  • T-tree

  • Tango tree

  • Threaded binary tree

  • Top tree

  • Treap

  • WAVL tree

  • Weight-balanced tree

  • Dancing tree

  • 2–3 tree

  • 2–3–4 tree

  • Queap

  • Fusion tree

  • Bx-tree

  • AList

  • Binomial heap

  • Fibonacci heap

  • AF-heap

  • Leonardo heap

  • 2–3 heap

  • Soft heap

  • Pairing heap

  • Leftist heap

  • Treap

  • Beap

  • Skew heap

  • Ternary heap

  • D-ary heap

  • Brodal queue

  • Compressed suffix array

  • FM-index

  • Generalised suffix tree

  • B-tree

  • Judy array

  • X-fast trie

  • Y-fast trie

  • Merkle tree

  • C tree

  • Link/cut tree

  • SPQR-tree

  • Spaghetti stack

  • Disjoint-set data structure (Union-find data structure)

  • Fusion tree

  • Enfilade

  • Exponential tree

  • Fenwick tree

  • Van Emde Boas tree

  • Rose tree

  • K-d tree

  • Implicit k-d tree

  • Min/max k-d tree

  • Relaxed k-d tree

  • Adaptive k-d tree

  • Quadtree

  • Octree

  • Linear octree

  • Z-order

  • UB-tree

  • R-tree

  • R+ tree

  • R* tree

  • Hilbert R-tree

  • X-tree

  • Metric tree

  • Cover tree

  • M-tree

  • VP-tree

  • BK-tree

  • Bounding interval hierarchy

  • Bounding volume hierarchy

  • BSP tree

  • Rapidly exploring random tree

  • Minimax tree

  • Expectiminimax tree

  • Finger tree

  • Expression tree

  • Log-structured merge-tree

  • Lexicographic Search Tree

  • Dynamic perfect hash table

  • Hash array mapped trie

  • Hash list

  • Hash table

  • Hash tree

  • Hash trie

  • Koorde

  • Prefix hash tree

  • Rolling hash

  • MinHash

  • Quotient filter

  • Ctrie

  • Scene graph

  • Decision tree

    • Binary decision diagram

  • Zero-suppressed decision diagram

  • And-inverter graph

  • Directed graph

  • Directed acyclic graph

  • Propositional directed acyclic graph

  • Multigraph

  • Hypergraph

  • Symbol table

    edit
    Array
    Bit array
    Bit field
    Bitboard
    Doubly linked list
    Array list
    Linked list
    Association list
    Tree (data structure)
    AA tree
    AVL tree
    Binary search tree
    Binary tree
    B-tree
    B+ tree
    B*-tree
    B sharp tree
    Heap
    Binary heap
    B-heap
    Weak heap
    Tree (data structure)
    Radix tree
    Suffix tree
    Suffix array
    Ternary tree
    K-ary tree
    And–or tree
    (a,b)-tree
    space partitioning
    binary space partitioning
    Segment tree
    Interval tree
    Range tree
    Bin
    Abstract syntax tree
    Parse tree
    Decision tree
    Alternating decision tree
    Bloom filter
    Count–min sketch
    Distributed hash table
    Double hashing
    graph
    Graph
    Adjacency list
    Adjacency matrix
    Graph-structured stack
    Lightmap
    Winged edge
    Quad-edge
    Routing table