heap data structure
A heap data structure is a complete binary tree that satisfies the heap property, where in a max heap, the value of each node is greater than or equal to the values of its children, and in a min heap, the value of each node is lesser than or equal to the values of its children.
Requires login.
Related Concepts (29)
- balanced binary heap
- binary heap
- binary heap implementation
- binary heap representation
- binary heap visualization
- binomial heap
- d-ary heap
- deletion in heap
- fibonacci heap
- heap
- heap space allocation
- heapify
- heaps as priority queues
- heapsort
- insertion in a binary heap
- insertion in heap
- leftist heap
- max heap
- median heap
- mergeable heap
- min heap
- min-heap
- pairing heap
- priority queue
- sift down
- sift up
- skew heap
- time complexity of heap operations
- traversing heap