Describe a method for combining t1 and t2 into a tree t


Problem

Suppose two binary trees, T1 and T2, hold entries satisfying the heap-order property. Describe a method for combining T1 and T2 into a tree T whose internal nodes hold the union of the entries in T1 andT2 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.

Request for Solution File

Ask an Expert for Answer!!
Data Structure & Algorithms: Describe a method for combining t1 and t2 into a tree t
Reference No:- TGS02634380

Expected delivery within 24 Hours