X

DAYS

:

HOUR

:

MINS

:

SEC

Copied to Clipboard
Merge two BST 's
Hard Accuracy: 50.0% Submissions: 31566 Points: 8

Given two BSTs, return elements of both BSTs in sorted form.

Example 1:

Input:
BST1:
5
/   \
3     6
/ \
2   4
BST2:
2
/   \
1     3
\
7
/
6
Output: 1 2 2 3 3 4 5 6 6 7
Explanation:
After merging and sorting the
two BST we get 1 2 2 3 3 4 5 6 6 7.


Example 2:

Input:
BST1:
12
/
9
/ \
6   11
BST2:
8
/  \
5    10
/
2
Output: 2 5 6 8 9 10 11 12
Explanation:
After merging and sorting the
two BST we get 2 5 6 8 9 10 11 12.

You don't need to read input or print anything. Your task is to complete the function merge() which takes roots of both the BSTs as its input and returns an array of integers denoting the node values of both the BSTs in a sorted order.

Expected Time Complexity: O(M+N) where M and N are the sizes if the two BSTs.
Expected Auxiliary Space: O(Height of BST1 + Height of BST2).

Constraints:
1 ≤ Number of Nodes ≤ 105

to report an issue on this page.

### Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?