Post order java solution

  • 0
    public class Solution {
        public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
            if(t1==null && t2==null) return null;
            if(t1==null && t2!=null) return t2;
            if(t1!=null && t2==null) return t1;
            TreeNode n1 = mergeTrees(t1.left, t2.left);
            TreeNode n2 = mergeTrees(t1.right, t2.right);
            TreeNode node = new TreeNode(t1.val + t2.val);
            node.left = n1;
            node.right = n2;
            return node;

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.