Fibonacci heap operation need to be done on o(n) time

前端 未结 0 434
抹茶落季
抹茶落季 2021-01-07 15:52

we want O(n) sequence of Fibonacci-heap operations that create a Fibonacciheap which has more number of marked nodes than the number of unmarked ones...

---- I am not

相关标签:
回答
  • 消灭零回复
提交回复
热议问题