See trees, think recursion


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

Log in to reply
 

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