Heap

Flashcards

1 / 6

data_structure tree graph memory_management memory_region dynamic_memory binary_heap d_ary_heap binomial_heap fibonacci_heap pairing_heap leftist_heap skew_heap min_heap max_heap soft_heap

💬 Click on the content to Ask AI

Explore More

🔥🔥 heapify → Heapify relies on understanding heap properties, complete binary tree array representation, and parent/child index relationships to perform comparisons and swaps that restore the heap order.

🔥 heap sort → Heaps enable the in-place O(n log n) sorting algorithm heapsort by building a heap and repeatedly extracting the extreme element to produce a sorted array.

🌟 dijkstra algorithm →

⭐️ prim algorithm →

⚡️ heap based priority queue →

⚡️ binary tree array representation →

⚡️ priority queue adt →