首页 > 代码库 > 617. Merge Two Binary Trees
617. Merge Two Binary Trees
https://leetcode.com/problems/merge-two-binary-trees/#/description
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.
You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of new tree.
Example 1:
Input: Tree 1 Tree 2 1 2 / \ / \ 3 2 1 3 / \ \ 5 4 7 Output: Merged tree: 3 / 4 5 / \ \ 5 4 7
Note: The merging process must start from the root nodes of both trees.
Sol:
If two trees are not none, then add values from too trees to be the new root. And the left child of the newroot is written by calling the merTrees function recursively. The inputs are left leaf of the first tree and the left leaf of the second tree. Do this the same to the right leaf of newroot.
If one of the trees is none while another is not none, return the existing tree. If both trees are none, return none then.
# Definition for a binary tree node. class TreeNode(object): def __init__(self, x): self.val = x self.left = None self.right = None class Solution(object): def mergeTrees(self, t1, t2): if t1 and t2: root = TreeNode(t1.val + t2.val) root.left = self.mergeTrees(t1.left, t2.left) root.right = self.mergeTrees(t1.right, t2.right) return root else: return t1 or t2
617. Merge Two Binary Trees
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。