Wednesday
April 23, 2014

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:
Answer:

Related Questions

math - The following numbers can be represented as 8-bit numbers in the binary ...
math - the binary system is used for computer programming. a binary number ...
programming - The Binary Tree is one of the best ways to organize data when you ...
computer science - What is the binary representation of the following ...
computer science /use java language - write the program that inputs a string ...
binary compounds - an example of a binary compound is Take a metal and combine ...
chemistry - I have 3 questions that I am uncertain about. 1) what determines the...
math - Find the binary equivalent of x^8+x^3+x+1 x^1000 + x^11 + x + 1 I just ...
computer or math - pls help me to solve this question. thank you very much ...
binary compounds! - based on only differences in electro negativity, what ...

Search
Members