computer science
posted by chase on .
suppose binary heaps are represented using a pointerbased 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

how do i do this