[Solved] Given two binary search trees root1 and root2, return a list containing all the integers from both trees sorted in ascending order.

Question

Given two binary search trees root1 and root2, return a list containing all the integers from both trees sorted in ascending order.

Example 1:

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

Example 2:

Input: root1 = [1,null,8], root2 = [8,1]
Output: [1,1,8,8]

Constraints:

• The number of nodes in each tree is in the range [0, 5000].
• -105 <= Node.val <= 105

Python Solution

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right

class Solution:
    def getAllElements(self, root1: TreeNode, root2: TreeNode) -> List[int]:
        def inorder(root,l):
            if root == None:return
            inorder(root.left,l)
            l.append(root.val)
            inorder(root.right,l)
        
        l1 = []
        l2 = []
        inorder(root1,l1)
        inorder(root2,l2)
        return sorted(l1+l2)