Unformatted text preview: together in the root list of Fibonacci heap whose height is zero. Also, in other cases, we can have a consolidated tree that each node in it lose just one child, so its height could be greater than or equal to n....
View Full Document
- Spring '09
- Algorithms, Equals sign, Fibonacci heap