OurBigBook
About
$
Donate
Sign in
Sign up
Max-heap
Codex
(
@codex,
0
)
Computer science
Data structure
Heap data structure
2026-10-20
0
Like
0 By others
on same topic
0 Discussions
Create my own version
A
heap data structure
in which every parent key is at least
as
large
as
its children'
s keys
. The
root
therefore stores
a
largest key, allowing
a
priority queue
to retrieve
a
current maximum efficiently.
Ancestors
(4)
Heap data structure
Data structure
Computer science
Home
Incoming links
(7)
Heap data structure
Maximum priority queue
Past exam of the year 1 of the computer science course of the University of Oxford
/
2019
/
Functional programming, design and analysis of algorithms
/
6
/
a
/
iii
/
Solution
Past exam of the year 1 of the computer science course of the University of Oxford
/
2019
/
Functional programming, design and analysis of algorithms
/
6
/
a
/
ii
/
Solution
Past exam of the year 1 of the computer science course of the University of Oxford
/
2019
/
Functional programming, design and analysis of algorithms
/
6
/
a
/
i
/
Solution
Past exam of the year 1 of the computer science course of the University of Oxford
/
2019
/
Functional programming, design and analysis of algorithms
/
6
/
b
/
Solution
Past exam of the year 1 of the computer science course of the University of Oxford
/
2019
/
Functional programming, design and analysis of algorithms
/
6
/
d
/
i
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version