Easy to understand Java Solution- Preorder Traversal based


  • 0
    E
    /**
     * 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) {
            TreeNode res=null;
            if(t1==null && t2==null){
                return null;
            }
            else if(t1!=null && t2==null){
                return t1;
            }
            else if(t1==null && t2!=null){
                return t2;
            }
            else{
                res=new TreeNode(t1.val+t2.val);
                res.left= mergeTrees(t1.left,t2.left);
                res.right=mergeTrees(t1.right,t2.right);
                return res;
            }
        }
    }
    

Log in to reply
 

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