Question: 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

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

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!