Data structure cheat sheet: Difference between revisions

← Older edit Newer edit →

Revision as of 03:06, 25 October 2020

A quick cheat sheet on common algorithms and data structures:

Linear Structures

Linked Lists

Basic Implementation

String

Related Algorithms

Arrays

Sorting

Tree-based Structures

Binary Tree

Property

Traversal

Heap

A (binary) heap is a complete binary tree that keeps a sepcific condition of its nodes: For a max-heap, $A [p a r e n t [i]] > = A [i]$ , for a min-heap, $A [p a r e n t [i]] < = A [i]$ .

n-ary Tree

Union Find

Hashing Table

Graphs

Storage

Traverse

Properties

Algorithms

Dynamic Programming

Recursion

Searching

@@ Line 18: / Line 18: @@
 === Heap ===
+A (binary) heap is a complete binary tree that keeps a sepcific condition of its nodes: For a max-heap, <math>A[parent[i]] >= A[i]</math>, for a min-heap, <math>A[parent[i]] <= A[i]</math>.
 === n-ary Tree ===
 === Union Find ===