Please enable JavaScript.
Coggle requires JavaScript to display documents.
Heaps and Heapsort 6.4 L - Coggle Diagram
Heaps and Heapsort 6.4 L
Heap
Partially ordered
Priority queue
Complete Binary Tree
Parental Dominance
Root -> Highest
Operations
Find item with highest priority
Deleting item with highest priority
Swap with botom, remove and compare
Adding new item to subset
Insert at bottom and compare
Construction
Bottom Up
Constructs the heap
Swap positions
Top Down
Inserting 1 by 1
HeapSort
Stage1. Construct Heap
Stage 2. Apply Root-deletion n-1 times
Removing root in sequence