Suppose two binary trees, T1 and T2, hold entries satisfying

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.

Members

  • Access to 2 Million+ Textbook solutions
  • Ask any question from 24/7 available
    Tutors
$9.99
VIEW SOLUTION

OR

Non-Members

Get help from Computer science Tutors
Ask questions directly from Qualified Online Computer science Tutors .
Best for online homework assistance.