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.

    解题思路:

    还是递归的方法,直接上代码。

    代码:

     1 /**
     2  * Definition for a binary tree node.
     3  * struct TreeNode {
     4  *     int val;
     5  *     TreeNode *left;
     6  *     TreeNode *right;
     7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
     8  * };
     9  */
    10 class Solution {
    11 public:
    12     TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
    13         if (t1 == NULL) 
    14             return t2;
    15         if (t2 == NULL)
    16             return t1;
    17         TreeNode* node = new TreeNode(t1->val + t2->val);
    18         node->left = mergeTrees(t1->left, t2->left);
    19         node->right = mergeTrees(t1->right, t2->right);
    20         return node;
    21     }
    22 };
  • 相关阅读:
    v-model
    CSS background 属性
    渐变背景
    mint ui的field用法和修改样式的方法
    js 数组包含
    password 密码查询
    web 单一平台登录逻辑
    内存共享锁业务逻辑(原创)
    无限分类树操作
    根据日期获取,x岁x月x天
  • 原文地址:https://www.cnblogs.com/gsz-/p/9387715.html
Copyright © 2011-2022 走看看