Stack Overflow
Stack Overflow

Questions tagged [binomial-heap]

A binomial heap is a type of priority queue data structure implemented as a forest of binomial trees. Binomial heaps support fast insertion, deletion, and merging.

37 questions
0
votes
1 answer

Binomial Min Heap delete issue

Got this problem on a recent CS class quiz that I got wrong. These were the choices: 3,4 10,13 10, 9 10 I put 10 and am pretty sure I am right. Can someone explain why I am not?
Hamilton Hardy
  • 59
  • 1
  • 8
0
votes
1 answer

What's the most efficient way to convert a binomial tree into a sorted array of keys?

Say we are given a single-tree binomial heap, such that the binomial tree is of rank r, and thus holding 2^r keys. What's the most efficient way to convert it into a k<2^r length sorted array, with the k smallest keys of the tree? Let's assume we…
Ido
  • 397
  • 2
  • 7
  • 22
0
votes
0 answers

How do I insert values into this binomial heap?

Binomial-Heap How do I insert values like 52 into this heap? What does the arrow mean? How do I delete the smallest element? Thanks!
uoYkcuF
  • 1
  • 2
0
votes
1 answer

Counting the number of nodes in certain level binomial heap

We have a binomial heap that consist of 2016 nodes. Decompositing into binary we get 11111100000 THe heap consist of 6 strees with nodes 512 256 128 64 32 and 16. But how can we calculate the number of nodes in certain level? What is the formula…
J.dd
  • 145
  • 15
0
votes
1 answer

insert same values into binomial heap

I have to insert some values into binomial heap. For example 25, 26, 24, 60, 65, 62. It will look like follows: But then I have to insert 25, 68, 65 to the same heap. Should I insert 25 again or just skip it as it is already present in the heap?
Bob
  • 10,427
  • 24
  • 63
  • 71
-1
votes
1 answer

About binomial queue performance

Below text is from binomial queues article. Although both leftist and skew heaps support merging, insertion, and delete_min all effectively in O(log n) time per operation, there is room for improvement because we know that binary heaps support …
venkysmarty
  • 11,099
  • 25
  • 101
  • 184
-1
votes
1 answer

Can binomial heap be used to find connected components in a graph?

How can a binomial heap be useful in finding connected components of a graph, it cannot be used then why?
user12326536
1 2
3