GNU Free Documentation License . .

( « »)
: ,

, [1].

  • (Linear data structures)
    • (List)
      • (Array)
        • (Bitmaps)
          • (Images)
          • (Heightfields)
          • (Bloom filter)
        • (Parallel array)
      • (Linked list)
        • (Skip list)
        • (Unrolled linked list)
        • XOR- (Xor linked list)
      • V- (VList)
      • (Circular buffer)
    • (Associative array a.k.a. dictionary or map)
    • - (Hash table)
    • (Stack a.k.a. LIFO Last in, first out)
    • (Queue a.k.a. FIFO First in, first out)
      • (Priority queue), -- , .
    • (Deque)
    • (Buffer gap)
  • (Graph)
    • (Adjacency list)
    • (Disjoint-set data structure)
    • (Graph-structured stack)
    • (Scene graph)
      • B+
      • 2-3-
      • -
      • BSP-
      • M-Way Tree
      • (Binary search tree)
        • (Self-balancing binary search tree)
          • - (AVL tree)
          • - (Red-black tree)
          • (Scapegoat tree)
          • (Splay tree)
          • (van Emde Boas tree)
        • (Radix tree)
        • (Interval tree)
      • (Heap)
        • (Binary heap)
        • (Binomial heap)
        • (Fibonacci heap)
        • (Mergable heap)
        • 2-3- (2-3 heap)
        • (Soft heap)
      • (Parse tree)
      • (Quadtree) (Octree)
      • (Suffix tree)
      • (Trie)
        • (Patricia trie)
    • (Tagged union)
    • (Union)
    • (Table)


:

1
1
1
2

«» , , «». , « » «» , .

[] .

[]

  1. , , ,