Algorithm: A tutorial for beginners: Data-structure


This is the overview page of the data structure.

In computer science, a data structure is a data organization, management, and storage format that is usually chosen for efficient access to data. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data, i.e., it is an algebraic structure about data.[1]

Next, I will introduce the following interesting data structures one by one. You are also welcome to add other data structures you want to learn.(Of course, I may give up because it is too difficult to introduce.)

Data structures

  • Linear Data Structure
    • Stack
    • Queue
    • Linear list
  • Sparse Table
  • Skip list
  • Block Data Structure
    • Introduction of Core Idea
    • Array
    • Linked List
    • Tree
    • Sqrt Tree
  • Tree Data Structure
    • Disjoint Set Union
    • Fenwick
    • Dividing Tree
    • PQ Tree
    • Finger Tree
    • Huffman Tree
    • Segment Tree
      • Segment Tree
      • Segment Tree Beats
      • Persistent Segment Tree
      • Li Chao Tree
    • Binary Search Tree
      • K-D Tree
      • Cartesian tree
      • Balanced Tree
        • Introduction
        • Splay
        • Treap
        • Size Balanced Tree
        • AVL
        • Scapegoat Tree
        • Leafy Tree
        • Weight Balanced Leafy Tree
        • Red-Black Tree
        • B-Tree
        • B+ Tree
    • Dynamic Tree
      • Link Cut Tree
      • Euler Tour Tree
      • Top Tree
    • Tree in tree
  • String related data structures
    • Introduction
    • Hash Table
    • Trie
    • Suffix Array
    • Deterministic finite automaton
      • Introduction
      • AC Automation
      • Suffix Automation
      • Sequence Automation
      • Palindrome Tree
    • Suffix Binary Search Tree


  1. Data_structure. In Wikipedia. https://en.wikipedia.org/wiki/Data_structure