arrow-left

All pages
gitbookPowered by GitBook
1 of 1

Loading...

Data Structures Types

hashtag
Linear data structures

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

hashtag
Arrays[]

hashtag
Lists

hashtag
Trees

Main article:

hashtag
Binary trees

hashtag
B-trees

hashtag
Heaps

hashtag
Trees

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

hashtag
Multi-way trees

hashtag
Space-partitioning trees

These are data structures used for or .

hashtag
Application-specific trees

hashtag
Hash-based structures

hashtag
Graphs

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

hashtag
Other

  • VList

  • also known as half-edge

  • editarrow-up-right
    Arrayarrow-up-right
    Bit arrayarrow-up-right
    Bit fieldarrow-up-right
    Doubly linked listarrow-up-right
    Array listarrow-up-right
    Linked listarrow-up-right
    Tree (data structure)arrow-up-right
    AA treearrow-up-right
    AVL treearrow-up-right
    Binary search treearrow-up-right
    B-treearrow-up-right
    B+ treearrow-up-right
    B*-treearrow-up-right
    Heaparrow-up-right
    Binary heaparrow-up-right
    B-heaparrow-up-right
    Tree (data structure)arrow-up-right
    Radix treearrow-up-right
    Suffix treearrow-up-right
    Ternary treearrow-up-right
    K-ary treearrow-up-right
    And–or treearrow-up-right
    space partitioningarrow-up-right
    binary space partitioningarrow-up-right
    Segment treearrow-up-right
    Interval treearrow-up-right
    Range treearrow-up-right
    Abstract syntax treearrow-up-right
    Parse treearrow-up-right
    Decision treearrow-up-right
    Bloom filterarrow-up-right
    Count–min sketcharrow-up-right
    Distributed hash tablearrow-up-right
    grapharrow-up-right
    Grapharrow-up-right
    Adjacency listarrow-up-right
    Adjacency matrixarrow-up-right
    Lightmaparrow-up-right
    Winged edgearrow-up-right
    Quad-edgearrow-up-right
    Bitboardarrow-up-right
    Bitmaparrow-up-right
    Circular bufferarrow-up-right
    Control tablearrow-up-right
    Imagearrow-up-right
    Dope vectorarrow-up-right
    Dynamic arrayarrow-up-right
    Gap bufferarrow-up-right
    Hashed array treearrow-up-right
    Lookup tablearrow-up-right
    Matrixarrow-up-right
    Parallel arrayarrow-up-right
    Sorted arrayarrow-up-right
    Sparse matrixarrow-up-right
    Iliffe vectorarrow-up-right
    Variable-length arrayarrow-up-right
    Association listarrow-up-right
    Self-organizing listarrow-up-right
    Skip listarrow-up-right
    Unrolled linked listarrow-up-right
    Conc-tree listarrow-up-right
    Xor linked listarrow-up-right
    Zipperarrow-up-right
    Doubly connected edge listarrow-up-right
    Difference listarrow-up-right
    Free listarrow-up-right
    Binary treearrow-up-right
    Cartesian treearrow-up-right
    Conc-tree listarrow-up-right
    Left-child right-sibling binary treearrow-up-right
    Order statistic treearrow-up-right
    Pagodaarrow-up-right
    Randomized binary search treearrow-up-right
    Red–black treearrow-up-right
    Ropearrow-up-right
    Scapegoat treearrow-up-right
    Self-balancing binary search treearrow-up-right
    Splay treearrow-up-right
    T-treearrow-up-right
    Tango treearrow-up-right
    Threaded binary treearrow-up-right
    Top treearrow-up-right
    Treaparrow-up-right
    WAVL treearrow-up-right
    Weight-balanced treearrow-up-right
    B sharp treearrow-up-right
    Dancing treearrow-up-right
    2–3 treearrow-up-right
    2–3–4 treearrow-up-right
    Queaparrow-up-right
    Fusion treearrow-up-right
    Bx-treearrow-up-right
    AListarrow-up-right
    Weak heaparrow-up-right
    Binomial heaparrow-up-right
    Fibonacci heaparrow-up-right
    AF-heaparrow-up-right
    Leonardo heaparrow-up-right
    2–3 heaparrow-up-right
    Soft heaparrow-up-right
    Pairing heaparrow-up-right
    Leftist heaparrow-up-right
    Treaparrow-up-right
    Beaparrow-up-right
    Skew heaparrow-up-right
    Ternary heaparrow-up-right
    D-ary heaparrow-up-right
    Brodal queuearrow-up-right
    Suffix arrayarrow-up-right
    Compressed suffix arrayarrow-up-right
    FM-indexarrow-up-right
    Generalised suffix treearrow-up-right
    B-treearrow-up-right
    Judy arrayarrow-up-right
    X-fast triearrow-up-right
    Y-fast triearrow-up-right
    Merkle treearrow-up-right
    C treearrow-up-right
    (a,b)-treearrow-up-right
    Link/cut treearrow-up-right
    SPQR-treearrow-up-right
    Spaghetti stackarrow-up-right
    Disjoint-set data structure (Union-find data structure)arrow-up-right
    Fusion treearrow-up-right
    Enfiladearrow-up-right
    Exponential treearrow-up-right
    Fenwick treearrow-up-right
    Van Emde Boas treearrow-up-right
    Rose treearrow-up-right
    Binarrow-up-right
    K-d treearrow-up-right
    Implicit k-d treearrow-up-right
    Min/max k-d treearrow-up-right
    Relaxed k-d treearrow-up-right
    Adaptive k-d treearrow-up-right
    Quadtreearrow-up-right
    Octreearrow-up-right
    Linear octreearrow-up-right
    Z-orderarrow-up-right
    UB-treearrow-up-right
    R-treearrow-up-right
    R+ treearrow-up-right
    R* treearrow-up-right
    Hilbert R-treearrow-up-right
    X-treearrow-up-right
    Metric treearrow-up-right
    Cover treearrow-up-right
    M-treearrow-up-right
    VP-treearrow-up-right
    BK-treearrow-up-right
    Bounding interval hierarchyarrow-up-right
    Bounding volume hierarchyarrow-up-right
    BSP treearrow-up-right
    Rapidly exploring random treearrow-up-right
    Alternating decision treearrow-up-right
    Minimax treearrow-up-right
    Expectiminimax treearrow-up-right
    Finger treearrow-up-right
    Expression treearrow-up-right
    Log-structured merge-treearrow-up-right
    Lexicographic Search Treearrow-up-right
    Double hashingarrow-up-right
    Dynamic perfect hash tablearrow-up-right
    Hash array mapped triearrow-up-right
    Hash listarrow-up-right
    Hash tablearrow-up-right
    Hash treearrow-up-right
    Hash triearrow-up-right
    Koordearrow-up-right
    Prefix hash treearrow-up-right
    Rolling hasharrow-up-right
    MinHasharrow-up-right
    Quotient filterarrow-up-right
    Ctriearrow-up-right
    Graph-structured stackarrow-up-right
    Scene grapharrow-up-right
    Decision treearrow-up-right
    Binary decision diagramarrow-up-right
    Zero-suppressed decision diagramarrow-up-right
    And-inverter grapharrow-up-right
    Directed grapharrow-up-right
    Directed acyclic grapharrow-up-right
    Propositional directed acyclic grapharrow-up-right
    Multigrapharrow-up-right
    Hypergrapharrow-up-right
    Routing tablearrow-up-right
    Symbol tablearrow-up-right