- Access to
**2 Million+**Textbook solutions - Ask any question from
**24/7**available

Tutors

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

Members

- Access to
**2 Million+**Textbook solutions - Ask any question from
**24/7**available

Tutors

OR

Non-Members

Get help from** Computer science **Tutors

Ask questions directly from** Qualified Online Computer science Tutors **.

Best for online homework assistance.