February 21, 2017

Homework Help: computer science

Posted by chase on Thursday, April 17, 2008 at 11:35pm.

suppose binary heaps are represented using a pointer-based tree representation instead of an array. consider the problem of merging binary heap LHS with RHS. assume both heaps are full complete trees, containing (2^L) - 1 and (2^R) -1 nodes, respectively.
Give two O(log N) algorithms to merge the two heaps if L = R and if |L - R| = 1

Answer This Question

First Name:
School Subject:

Related Questions

More Related Questions