Top "Heap" questions

A heap (data structure) is a tree that is ordered with respect to depth.

Why are two different concepts both called "heap"?

Why are the runtime heap used for dynamic memory allocation in C-style languages and the data structure both called "the …

c++ heap terminology heap-memory
PriorityQueue/Heap Update

Does Java have an easy way to reevaluate a heap once the priority of an object in a PriorityQueue has …

java heap priority-queue
Java Memory Limit -Xmx suffix: upper vs lower case m/M and g/G

It is commonly known that it is possible to limit the Java heap size with -Xmx<amount><…

java memory jvm heap jvm-arguments
Is there a PriorityQueue implementation with fixed capacity and custom comparator?

Related questions: Java PriorityQueue with fixed size How do I use a PriorityQueue? get indexes of n smallest elements in …

java scala heap priority-queue
Heap Inspection Security Vulnerability

I have run my java app against the checkmarx tool for security vulnerability and it is constantly giving an issue …

java security heap static-code-analysis checkmarx
Is there a standard Java implementation of a Fibonacci heap?

I was looking at the different kind of heap data structures. The Fibonacci heap seems to have the better worst …

java data-structures heap fibonacci-heap
easy way to maintain a min heap with stl?

for user defined struct, as I understand, it's easy. Just overload the operator <. However, for int/float etc.., do …

c++ stl heap min-heap
Tomcat not starting : Not able to reserve enough space for object heap

When starting tomcat I get the error Not able to reserve enough space for Object Heap Not able to create …

tomcat jvm heap catalina
Is there a way to lower Java heap when not in use?

I'm working on a Java application at the moment and working to optimize its memory usage. I'm following the guidelines …

java memory-management heap
O(klogk) time algorithm to find kth smallest element from a binary heap

We have an n-node binary heap which contains n distinct items (smallest item at the root). For a k<=…

algorithm search data-structures heap time-complexity