Simple Java Recursive Solution


  • 0
    K
    public class Solution {
        public boolean isSameTree(TreeNode p, TreeNode q) {
            if(p == null && q == null) return true;
            if( (p != null && q == null) ||
                (q != null && p == null) || 
                (p.val != q.val)) {
                return false;
            }
            return (isSameTree(p.left,q.left) && isSameTree(p.right,q.right));
        }
    }
    

Log in to reply
 

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