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

- computer science -
**Anonymous**, Tuesday, November 18, 2014 at 6:04pm
how do i do this

## Answer this Question

## 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 ...
- computer science - What is the binary representation of the following ...
- Algebra - I'm not quite sure about these problems. I know how to do them, but it...
- computer science /use java language - write the program that inputs a string ...
- programming - The Binary Tree is one of the best ways to organize data when you ...
- computer networks. - Question 1 (PIM) Assume you have a source S, and assume ...
- chemistry - I have 3 questions that I am uncertain about. 1) what determines the...
- binary compounds - an example of a binary compound is Take a metal and combine ...
- computer or math - pls help me to solve this question. thank you very much ...