simple java recursive traversal solution


  • 0
    I
    /**
     * 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(null == p && null == q) {
                return true;
            }
            
            if(null == p || null == q) {
                return false;
            }
            
            if(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.