X

DAYS

:

HOUR

:

MINS

:

SEC

Copied to Clipboard
Find Common Nodes in two BSTs
Easy Accuracy: 49.82% Submissions: 22666 Points: 2

Given two Binary Search Trees. Find the nodes that are common in both of them, ie- find the intersection of the two BSTs.

Example 1:

Input:
BST1:
5
/     \
1        10
/   \      /
0     4    7
\
9
BST2:
10
/    \
7     20
/   \
4     9
Output: 4 7 9 10



Example 2:

Input:
BST1:
10
/  \
2   11
/  \
1   3
BST2:
2
/  \
1    3
Output: 1 2 3


You don't need to read input or print anything. Your task is to complete the function findCommon() that takes roots of the two BSTs as input parameters and returns a list of integers containing the common nodes in sorted order.

Expected Time Complexity: O(N1 + N2) where N1 and N2 are the sizes of the 2 BSTs.
Expected Auxiliary Space: O(H1 + H2) where H1 and H2 are the heights of the 2 BSTs.

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?