6.17 Suppose that binary heaps are represented using explicit links. Consider the problem of merging binary heap lhs with rhs. Assume both heaps are perfect binary trees, containing 2l − 1 and 2r − 1 nodes, respectively. a. Give an O(logN) algorithm to merge the two heaps if l = r. b. Give an O(logN) algorithm to merge the two heaps if |l − r| = 1. c. Give an O(log2 N) algorithm to merge the two heaps regardless of l and r. - | |
| View Solution | |
| << Back | Next >> |