Know your heaps
is a root of some tree in a Fibonacci heap. Right before
a
deletemin
operation,
has no children and that after the
deletemin
has 10 children. Let
be the set of children of
after the delete and let
ranks(C)
be the set of rank values for the nodes in
(since this is a set, if several nodes in
have the same rank, their rank value appears just once in
ranks(C)
. What is the largest value in
ranks(C)
right after the
deletemin
?
The answer is 9.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!