What is wrong with the following code of insertion in fibonacci heap Choose the correct optionFIB-INSERT(H, x) degree[x]= 0 p[x]=  NIL child[x] =NIL left[x] =x right[x] =x mark[x] =FALSE concatenate the root list containing x with root list H  if min[H] = NIL or key[x] > key[min[H]] then min[H]= x n[H]= n[H] + 1

Comments and Answers (2)

Andy

Andy

What is the correct solution?

Priya

Priya

does anyone know the correct answer

Avatar

{{SampleComment.userName || "Your Name"}} ~ {{SampleComment.userCity}}

{{SampleComment.commentValue || "Your Answer or Comment goes here...."}}