+1 (218) 451-4151
glass
pen
clip
papers
heaphones

Suppose two binary trees, T 1 and T 2 , hold entries satisfying the heap-order property (but not…

Suppose two binary trees, T 1 and T 2 , hold entries satisfying the heap-order property (but not…

Suppose two binary trees, T1 and T2, hold entries satisfying the heap-order property (but not necessarily the complete binary tree property). Describe a method for combining T1 and T2 into a binary tree T, whose nodes hold the union of the entries in T1 and T2 and also satisfy the heap-order property. Your algorithm should run in time O(h1 + h2) where h1 and h2 are the respective heights of T1 and T2.