Julia code analysis - redundant analysis

Julia code analysis - 15 minutes

Input: 
	Tree 1                     Tree 2                  
          1                         2                             
         / \                       / \                            
        3   2                     1   3                        
       /                           \   \                      
      5                             4   7                  
Output: 
Merged tree:
	     3
	    / \
	   4   5
	  / \   \ 
	 5   4   7
   
   root -> both of null 
   11:59 pm 
   
   binary tree -> 
   
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * }; 
 */
 
 Node MergeTwoTree(Node root1,  Node root2)
 {
   if(root1 == null || root2 == null)
   {
      return null; 
   }
   
   if(root1 == null)
   {
   		return MergeTwoTree(root2, root1); 
   }
   
   if(root2 == null)
   {
   		return root1; 
   }
   
   // base case
   root1.val += root2.val; 
   
   var rootLeft  = MergeTwoTree(root1.left, root2.left); 
   var rootRight = MergeTwoTree(root2.right, root2.right);
   
   root1.left = rootLeft; 
   root1.right = rootRight; 
   
   return root1; 
 }