# Given two binary search trees, return elements of both binary search trees in sorted form. 1) complete the function Merge()

This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

## Question:

Given two binary search trees, return elements of both binary search trees in sorted form.

1) complete the function Merge() which takes roots of both binary search trees as its parameter and returns the binary search tree in a sorted order that merges the node values of both binary search trees

**Related Book For**

## Data Structures and Algorithms in Java

ISBN: 978-1118771334

6th edition

Authors: Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser

**View Solution**

Create a free account to access the answer

**Cannot find your solution?**

Post a FREE question now and get an answer within minutes.
* Average response time.

**Question Details**

Chapter #

**10**Section: Exercises

Problem: 48