1. Code
class Solution:
def __init__(self):
self.buf = [] # it is a buffer to store values from trees
def getVals(self, node): # store values in ascending order
if node.left:
self.getVals(node.left)
self.buf.append(node.val)
if node.right:
self.getVals(node.right)
def getAllElements(self, root1: TreeNode, root2: TreeNode) -> List[int]:
if root1: # get every value in the first tree
self.getVals(root1)
if root2: # get every value in the second tree
self.getVals(root2)
return sorted(self.buf)
2. Result
Runtime : 288 ms(100.00%), Memory usage : 21.6 MB(60.89%)
(Runtime can be different by a system even if it is a same code.)