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
    class Solution {
        public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
            if (t1 == null) {
                return t2;
            }
            if (t2 == null) {
                return t1;
            }
            
            return dfs(t1, t2);
        }
        private TreeNode dfs(TreeNode t1, TreeNode t2) {
            
            if (t1 == null && t2 == null) {
                return null;
            }
            int sum = 0;
            if (t1 != null) {
                sum += t1.val;
            }
            if (t2 != null) {
                sum += t2.val;
            }
            TreeNode head = new TreeNode(sum);
            
            head.left = dfs(t1 == null ? null : t1.left, t2 == null ? null : t2.left);
            head.right = dfs(t1 == null ? null : t1.right, t2 == null ? null : t2.right);
            return head;
        }
    }
    

      

  • 相关阅读:
    java基础 01
    c++11——模板的细节改进
    c++11——auto,decltype类型推导
    poj_1182 并查集
    poj_1988 并查集
    poj_1161 并查集
    poj_3067 树状数组
    poj_2182 线段树/树状数组
    poj_1190 树状数组
    动态规划
  • 原文地址:https://www.cnblogs.com/apanda009/p/7590224.html
Copyright © 2011-2022 走看看