Back to Heap Data Structures
Leftist Heap Visualization
Merge-driven min-heap with null path length (npl) balancing.
Heap Visualization
Empty Leftist Heaps
Current Step
Select an operation to begin visualization.
Complexity Analysis
O(log n)
Merge
O(log n)
Insert
O(log n)
Extract Min
Heap Stats (Current View)
0
Nodes in Heap A
0
Height of Heap A
Key Properties
• Min-heap order: root stores the smallest key.
• Leftist rule: npl(left) ≥ npl(right) at every node.
• Merge is the fundamental primitive used by insert and extract-min.