Skip to search formSkip to main contentSkip to account menu

Min-max heap

In computer science, a min-max heap is a complete binary tree data structure which combines the usefulness of both a min-heap and a max-heap, that is… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Binary treeComputer scienceData structureDouble-ended priority queue

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Micro Combined Heat and Power to Provide Heat and Electrical Power using Biomass and Gamma-type Stirling Engine
Highly Cited
2014
Highly Cited
2014
High hydrostatic pressure effect on chemical composition, color, phenolic acids and antioxidant capacity of Cape gooseberry pulp (Physalis peruviana L.)
2011
2011
Audio watermarking scheme with dynamic adjustment in mute period
2010
2010
Hainan Min Passives
This paper explores the Hainan Min passive construction and passive markers. As in most Chinese languages, there are two strata… 
2009
2009
Torah min haShamayim: Conflicts between Religious Belief and Scientific Thinking
Just over sixty years ago, the Association of Orthodox Jewish Scientists was founded to resolve “the apparent points of conflict… 
2000
2000
Radiation annealing induced by electronic excitation in iron
2000
2000
Min-Max Fine Heaps
In this paper we present a new data structure for double ended priority queue, called min-max fine heap, which combines the… 
1993
1993
The relaxed min-max heap
A data structure that implements a mergeable double-ended priority queue, namely therelaxed min-max heap, is presented. A relaxed… 
1988
1988
Two New Algorithms for Constructing Min-Max Heaps
In this paper we study the computational complexity of constructing implicit, doubleended priority queues organized as min-max… 
1987
1987
Bounds for min-max heaps
Very recently a new data structure, called a min-max heap, was presented for implementing the double-ended priority queue. A min… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)