@@ -0,0 +1,811 @@
+/**%0A * Author : Laberat%0A * Date   : 16/2/4.%0A * Link   : https://leetcode.com/problems/same-tree/%0A * Number : # 100%0A * Desc   : 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 */%0Apublic class SameTree %7B%0A%0A    public boolean isSameTree(TreeNode p, TreeNode q) %7B%0A        if (p == null && q == null) return true;%0A        if (p == null && q != null) return false;%0A        if (p != null && q == null) return false;%0A        if (p.val != q.val) return false;%0A        return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);%0A    %7D%0A%0A    class TreeNode %7B%0A        int val;%0A        TreeNode left;%0A        TreeNode right;%0A        TreeNode(int x) %7B val = x; %7D%0A    %7D%0A%7D%0A

solve # 100