LeetCode 617. Merge Two Binary Trees

来源:互联网 发布:疯狂淘宝李涛微博 编辑:程序博客网 时间:2024/05/29 16:28

题意

将两棵树上的值相加,合并到一棵树上。

解题思路

同时对两棵树进行递归遍历

参考代码

// java/** * Definition for a binary tree node. * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode(int x) { val = x; } * } */public class Solution {    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {        if (t1 == null)            return t2;        if (t2 == null)            return t1;        TreeNode t = new TreeNode(t1.val + t2.val);        t.left = mergeTrees(t1.left,t2.left);        t.right = mergeTrees(t1.right,t2.right);        return t;    }}
原创粉丝点击