All Elements In Two Binary Search Trees, is a LeetCode problem. In this post we will see how we can solve this challenge in C++

Problem Description

Example 1 :

Input: root1 = [2,1,4], root2 = [1,0,3] Output: [0,1,1,2,3,4]

Example 2 :

Input: root1 = [0,-10,10], root2 = [5,1,7,0,2] Output: [-10,0,0,1,2,5,7,10]

Example 3 :

Input: root1 = [], root2 = [5,1,7,0,2] Output: [0,1,2,5,7]

Example 4 :

Input: root1 = [0,-10,10], root2 = [] Output: [-10,0,10]

Example 5 :

Input: root1 = [1,null,8], root2 = [8,1] Outp ....

You can find the full details of the problem All Elements in Two Binary Search Trees at LeetCode

Solution: Please check the main.cpp snippet for the solution.

This solution originally posted at: Github by @kamyu104