# [Leet Code] All Elements in Two Binary Search Trees

`Input: root1 = [2,1,4], root2 = [1,0,3]Output: [0,1,1,2,3,4]`
`Input: root1 = [0,-10,10], root2 = [5,1,7,0,2]Output: [-10,0,0,1,2,5,7,10]`
`Input: root1 = [], root2 = [5,1,7,0,2]Output: [0,1,2,5,7]`
`Input: root1 = [0,-10,10], root2 = []Output: [-10,0,10]`
`Input: root1 = [1,null,8], root2 = [8,1]Output: [1,1,8,8]`
`# Definition for a binary tree node.# class TreeNode(object):#     def __init__(self, val=0, left=None, right=None):#         self.val = val#         self.left = left#         self.right = rightclass Solution(object):    def getAllElements(self, root1, root2):        """        :type root1: TreeNode        :type root2: TreeNode        :rtype: List[int]        """        elements = []        self.traverse(root1, elements)        self.traverse(root2, elements)        return sorted(elements)            def traverse(self, root, elements):        if root:            self.traverse(root.left, elements)            elements.append(root.val)            self.traverse(root.right, elements)`

--

--

--

Learning, and posting my findings!

Love podcasts or audiobooks? Learn on the go with our new app.

## Matthew Boyd

Learning, and posting my findings!