Sponsored
Sponsored
This approach utilizes recursion to traverse both trees simultaneously. If both node values are non-null, we sum them up as the new value and recursively merge their left and right children. If one node is null, we return the non-null node.
Time Complexity: O(n); Space Complexity: O(h), where n is the total number of nodes and h is the height of the tree.
1class TreeNode:
2 def __init__(self, x):
3 self.val = x
4 self.left = None
5 self.right = None
6
7def mergeTrees(t1, t2):
8 if not t1:
9 return t2
10 if not t2:
11 return t1
12 t1.val += t2.val
13 t1.left = mergeTrees(t1.left, t2.left)
14 t1.right = mergeTrees(t1.right, t2.right)
15 return t1This Python solution uses recursion to merge two binary trees. If either node is None, the function returns the other. Otherwise, it sums node values and recursively merges the child nodes.
This approach uses an iterative method with a stack to simulate the recursive calls for merging the two binary trees. We traverse the trees using a stack and merge nodes at each level iteratively.
Time Complexity: O(n); Space Complexity: O(h), where n is the total number of nodes and h is the maximum height of the two trees.
1import
This Java solution also uses an iterative approach with a Stack, processing nodes iteratively for merging and pushing children onto the stack for later processing, similar to the depth-first strategy.