Heap

Last updated Dec 14, 2021 Edit Source

• Cs data structures
• Cs trees

A heap is basically a Binary Tree which is complete(Full vs Complete Binary Trees) and every child of a parent node (Important Tree Terminology) has a value greater than or equal to the parent’s value.

|operation|Big-Oh Notation| |———-|——————| |size|$O(1)$| |min|$O(1)$| |insert|$O(log(n))$| |removeMin|$O(log(n))$|