leetcode|617. Merge Two Binary Trees(Java) leetcode|Tree

注：此博客不再更新，所有最新文章将发表在个人独立博客limengting.site。分享技术，记录生活，欢迎大家关注
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 1Tree 2 12 / \/ \ 3213 /\\ 547Output: Merged tree: 3 / \ 45 / \\ 547

【leetcode|617. Merge Two Binary Trees(Java)】Note: The merging process must start from the root nodes of both trees.

/** * 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 && t2 == null) return null; int val = (t1 == null ? 0 : t1.val) + (t2 == null ? 0 : t2.val); TreeNode newNode = new TreeNode(val); newNode.left = mergeTrees(t1 == null ? null : t1.left, t2 == null ? null : t2.left); newNode.right = mergeTrees(t1 == null ? null : t1.right, t2 == null ? null : t2.right); return newNode; } }

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