Java Recursion


  • 1
    M
    /**
     * Definition for a binary tree node.
     * public class TreeNode {
     *     int val;
     *     TreeNode left;
     *     TreeNode right;
     *     TreeNode(int x) { val = x; }
     * }
     */
    public class Solution {
        public boolean isSameTree(TreeNode p, TreeNode q) {
            if(p == null && q == null)
                return true;
            else if(p == null || q == null)
                return false;
            else
            {
                if(p.val == q.val)
                {
                    return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
                }
                else 
                    return false;
            }
        }
    }
    

Log in to reply
 

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