|
11.7 A standard implementation of Fibonacci heaps requires four links per node (parent, child, and two siblings). Show how to reduce the number of links, at the cost of at most a constant factor in the running tim e. - | |
| View Solution | |
| << Back | Next >> |