@@ -0,0 +1,676 @@
+/**%0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    public boolean isSameTree(TreeNode p, TreeNode q) %7B%0A        if((p == null && q != null) %7C%7C (p != null && q == null))%7B%0A            return false;%0A        %7D%0A        if(p == null && q == null)%7B%0A            return true;%0A        %7D%0A        if(p.val != q.val)%7B%0A            return false;%0A        %7D%0A        if(!isSameTree(p.left, q.left))%7B%0A            return false;%0A        %7D%0A        if(!isSameTree(p.right, q.right))%7B%0A            return false;%0A        %7D%0A        return true;%0A    %7D%0A%7D

Q100 Same Tree