Java - simple recursive solution


  • 0
    G
    /**
     * 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 || p == null && q != 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.