@@ -0,0 +1,666 @@
+/**%0A * Given two binary trees, write a function to check if they are equal or not.%0A * Two binary trees are considered equal if they are structurally identical and the nodes have the same value.%0A*/%0A/**%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) return true;%0A    if (p == null %7C%7C q == null) return false;%0A    return (p.val == q.val &&%0A            isSameTree(p.left, q.left) &&%0A            isSameTree(p.right, q.right));%0A    %7D%0A%7D%0A

Create 100.java