- Related Questions & Answers
- Binomial Heaps in Data Structure
- Fibonacci Heaps in Data Structure
- Interval Trees in Data Structure
- Inserting an Element in Interval Heaps
- Removing the Min Element from Interval Heaps
- Insertion and Deletion in Heaps in Data Sturcture
- Rectangle Data in Data Structure
- Halfedge data structure
- Deaps in Data Structure
- Quadtrees in Data Structure
- Pairing Heaps
- Soft Heaps
- Arrays Data Structure in Javascript
- Stack Data Structure in Javascript
- Graph Data Structure in Javascript

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Here we will see what is the interval heaps. The interval heaps are complete binary tree, in which, each node except possibly the last one contains two elements. Let the priorities of two elements in node P are ‘a’ and ‘b’. Here we are considering a ≤ b. We say that the node P represents the closed interval [a, b]. Here a is the left endpoint of the interval of P, and b is the right endpoint. The [c, d] is contained in the interval [a, b] if and only if a ≤ c ≤ d ≤ b. In an interval heap, the intervals represented by the left and right children of each node P are contained in the interval represented by P. When the last node is containing a single element with priority c, then a ≤ c ≤ b. Here [a, b] is interval of the parent of the last node.

This is consisting of min and max heaps. The max and min heaps.

This is Min Heap

This is Max Heap

Advertisements