Trees

Binary Heap

A complete tree that keeps its greatest element at the root.

Learn with an interactive visualization

Category: Trees. Complexity: Insert / extract O(log n) · Maximum O(1).

A complete tree that keeps its greatest element at the root. Interactive visualization, Java code, operations, complexity, and a complete…