🤔 No result found

👉 Don't loose hope, Try out below methods

Ask on Telegram
  • 💡 Search Tips
  • ➡️ Type question from start
  • ➡️ Use unique words from question
  • ❌ Don't search full question
Telegram Group 🔥🔥🔥 Get answers in minutes
Questions answered : 48 /50
Guy
Guy
Guy
Guy
Guy
+ 4981 more
Verified Answer verified

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

🗓 Dec 9, 2021

Answer is "Line 9"

Comments and Discussions

You don't need to login to post your comment

Comments:
30
Views:
60k
Likes:
120k
votes
Alexandra 🌐 India
Students helping students, nice idea
Was this answer helpful?
votes
Ashley 🌐 India
How?
Was this answer helpful?

Was your question answered?

Thanks for the feedback! ✅

Want to get famous? 📸

Answer question and get 🤩 high-lighted on our homepage.

Just Automated Logo

© 2017-2022 Foxoyo™
All rights reserved.

Facebook Connect with us