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.
2018
2018
Pharmacokinetic comparison of gossypol isomers in cattle: transfer from diet to plasma and degradation by rumen microbes
A pharmacokinetic comparison of gossypol isomers in cattle was made by investigating their transfer from ingested food to plasma… 
2015
2015
Det är inte min tid och plats att reagera : En intervjustudie om socialarbetares emotionella arbete.
In this study I have described parts of social workers emotional labout i the meeting with parents and/or children. I have… 
2013
2013
고등학생과 역사가의 역사 텍스트 독해 양상과 텍스트 독해 교수학습 전략
This paper analyzes how Korean 10th graders read historical texts and suggests several teaching strategies for using historical… 
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… 
2006
2006
Measurements on selected (semi)-solids in a wide temperature range using new solid clamps
Thermo Electron is launching a new temperature control module for the HAAKE MARS. The controlled test chamber (CTC) for… 
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… 
1989
1989
A note on constructing min-max heaps
In this paper we show that to construct an implicit, double-ended priority queue organized as a min-max heap, 17/9n = 1.88 ...n… 
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)