python (65.1k questions)

javascript (44.2k questions)

reactjs (22.7k questions)

java (20.8k questions)

c# (17.4k questions)

html (16.3k questions)

r (13.7k questions)

android (12.9k questions)

Questions - min-heap

Inserting a node in a min-heap with a null value at the end

I got a sorted min-heap array: 2,3,4,5,NULL I'd like to insert the value 1 in it, how would the first step be dealt with? 2 2 / \ / \ 3 4 ...
test-img

student

arrays

binary

binary-tree

heap

min-heap

Votes: 0

Answers: 1

Latest Answer

A heap of integers does not have NULL values. I suppose the NULL is an indication of the capacity of the heap, meaning it can only have one more value before being full. Would be this the same if the...
test-img

trincot

Time complexity higher than expected for min-heap custom functions

I am trying to implement a custom min-heap in python. I want to store tuples in the heap and order them with respect to the second element in the tuple. Here is my attempt at it:- class minheap(): d...
test-img

Sharan Kumar

python

data-structures

heap

min-heap

Votes: 0

Answers: 1

Latest Answer

There is nothing wrong with the complexity of your algorithm (note the appoximate factor of 10 of increased time when operating on 1e6 instead of 1e5 values). The standard library functions are just f...
test-img

Jakob Stark

Why is this minHeap implementation incorrect?

I am using a PriorityQueue to solve the Meeting Rooms II problem from Leetcode. I have developed my own solution that fails on certain test cases, yet from my eyes it is indistinguishable from the pro...
test-img

calvinhobbes123

java

java-8

comparator

priority-queue

min-heap

Votes: 0

Answers: 2

Latest Answer

else if(A[0]>B[0]){ return 0; } should be else if(A[0] == B[0]){ return 0; } You should return 0 if they're equal.
test-img

Louis Wasserman

Which data structure is more efficient for A*?

In A* search, which data structure would be more efficient ? Min-heap or Binary search tree. Considering that below operations are to be handled frequently: (a) extract min (b) search a node (c) updat...
test-img

aks

python-3.x

data-structures

binary-search-tree

a-star

min-heap

Votes: 0

Answers: 1

Latest Answer

A min-heap is a much simpler data structure than a balanced binary search tree, and it's typically implemented in an array, which reduces memory used and improves cache locality. For these reasons, a ...
test-img

Matt Timmermans

Posts

Questions

Blogs

Jobs