ThinkerQAQ

Data Structures & Algorithms

237 notes

Some notes are currently available only in Chinese. English translations are shown when available.

  1. 1.1 Data Structures and Algorithmshistorical

    Data structures and algorithms overview.

  2. 2.1 arrayhistorical

    Dynamic array implementation and two-pointer patterns.

    数据结构
  3. 2.2 hashmaphistorical

    Map implementations using a binary search tree and a hash table.

    数据结构
  4. 2.3 linkedlisthistorical

    Singly linked list, doubly linked list, circular doubly linked list, and problem-solving patterns.

    数据结构
  5. 2.4 queuehistorical

    Queue, circular queue, priority queue, and deque.

    数据结构
  6. 2.5 sethistorical

    An unordered set without duplicate elements.

    数据结构
  7. 2.6 stackhistorical

    A last-in-first-out stack.

    数据结构
  8. 2.7 treehistorical

    Binary trees, BST, AVL tree, Trie, and Huffman tree.

    数据结构
  9. 2.8 Red-Black Treehistorical

    Red-black tree properties, 2-3 trees, and implementation.

    数据结构
  10. 2.9 Skip Listhistorical

    Skip-list basics, motivation, implementation, and expected complexity.

    数据结构