Data structure cheat sheet: Difference between revisions
Jump to navigation
Jump to search
Hoppinglife (talk | contribs) |
Hoppinglife (talk | contribs) |
||
| Line 19: | Line 19: | ||
=== Heap === | === 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>. | 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>. A heap can be used to maintain a priority queue. | ||
==== Heapify ==== | |||
<syntaxhighlight> | |||
heapify(A) | |||
</syntaxhighlight> | |||
=== n-ary Tree === | === n-ary Tree === | ||
Revision as of 03:08, 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, , for a min-heap, . A heap can be used to maintain a priority queue.
Heapify
heapify(A)