`deletemin`

operation, \(R\) has no children and that after the `deletemin`

\(R\) has 10 children. Let \(C\) be the set of children of \(R\) after the delete and let `ranks(C)`

be the set of rank values for the nodes in \(C\) (since this is a set, if several nodes in \(C\) 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`

?

×

Problem Loading...

Note Loading...

Set Loading...