Solutions of Theory of Algorithms assignment20.4-1

Solutions of Theory of Algorithms assignment20.4-1 -...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Solutions of Theory of Algorithms assignment 2 Exercise 20.4-1 It is not necessary that the height of an n -node Fibonacci heap is O (lg n ). if we begin inserting nodes with an empty Fibonacci heap, we will get a set of n nodes connected
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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

Ask a homework question - tutors are online