zoukankan      html  css  js  c++  java
  • 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.

    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.

    class Solution {
        public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
            if(t1 == null && t2 == null) return null;
            TreeNode root = new TreeNode();
            if(t1 == null && t2 != null) {
                root.val = t2.val;
                root.left = mergeTrees(t1, t2.left);
                root.right = mergeTrees(t1, t2.right);
                return root;
            }
            else if(t1 != null && t2 == null) {
                root.val = t1.val;
                root.left = mergeTrees(t1.left, t2);
                root.right = mergeTrees(t1.right, t2);
                return root;
            }
            else {
                root.val = t1.val + t2.val;
                root.left = mergeTrees(t1.left, t2.left);
                root.right = mergeTrees(t1.right, t2.right);
                return root;
            }
        }
    }

    分几种情况,t1 t2是否为null,然后return即可。

    class Solution {
        public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
            if(t1 == null && t2 == null) return null;
            TreeNode root = new TreeNode();
            root.val = (t1 == null ? 0 : t1.val) + (t2 == null ? 0 : t2.val);
            root.left = mergeTrees(t1 == null ? null : t1.left, t2 == null ? null : t2.left);
            root.right = mergeTrees(t1 == null ? null : t1.right, t2 == null ? null : t2.right);
            return root;
        }
    }

    简单写法也可以

  • 相关阅读:
    轻轻松松看懂Spring AOP源码
    centos7安装openjdk8
    使用fiddler做弱网测试
    测试术语-好东西要跟大家一块分享-2
    测试思想-好东西与大家分享-1
    session、token、cookie的区别
    接口测试和功能测试的区别
    常见bug解析-移动端
    接口测试的简介
    软件测试基本理论
  • 原文地址:https://www.cnblogs.com/wentiliangkaihua/p/13649551.html
Copyright © 2011-2022 走看看