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;
        }
    }

    简单写法也可以

  • 相关阅读:
    CSS3学习-用CSS制作立体导航栏
    JS学习-事件响应小结-简单的计算器
    BOM学习-javascript计时器小结
    php 正则表达式
    zTree插件的应用
    css样式篇
    iso移动端input的bug解决(vue)
    html2canvas文字重叠(手机端)
    react中使用antd遇到的问题
    react开发初始配置和一些问题
  • 原文地址:https://www.cnblogs.com/wentiliangkaihua/p/13649551.html
Copyright © 2011-2022 走看看