LeetCode 617 Merge Two Binary Trees 解题报告
题目要求
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.
题目分析及思路
题目给出两个二叉树，要求得到一棵融合的二叉树，融合规则是有重叠的结点的值是原先结点的值的和，否则作为新树的结点。可以遍历每个结点然后如果重叠（两个二叉树结点都不为空）新结点值便为两者和，不重叠（只有一个结点为空）新结点值为不为空的值，全为空则跳出。按照这个逻辑进行迭代。
python代码
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def mergeTrees(self, t1, t2):
"""
:type t1: TreeNode
:type t2: TreeNode
:rtype: TreeNode
"""
if t1 is None and t2 is None:
return
if t1 is None:
return t2
if t2 is None:
return t1
t1.val += t2.val
t1.left = self.mergeTrees(t1.left,t2.left)
t1.right = self.mergeTrees(t1.right,t2.right)
return t1
最新文章
- 20145212&20145204信息安全系统实验四报告
- easyui相关script的配置
- easyUI 中datagrid 返回列隐藏方法
- 阿里巴巴B2B搜索学习
- jstl标签
- 简单的angular表单验证指令
- nginx下面server配置
- POJ 1190(深搜)
- ROS探索总结（三）——ROS新手教程【转】
- netty定时器HashedWheelTimer（zz）
- Deep Learning论文笔记之（四）CNN卷积神经网络推导和实现（转）
- BAT CMD 批处理文件脚本 -2
- 为了圣像画系统V1.0Beta版（javascript）-GIS520社区
- 这个夏天不AC(杭州电2037)
- git add -f
- zc702-自定义AXI-IP核实验
- ipsec在企业网中的应用（IKE野蛮模式）(转)
- Codeforces 913C - Party Lemonade
- hihocoder #1076 与链 dp
- 解决ueditor中没法动态配置imageurlprefix的方法