feat: add solution of Same Tree(100) with javascript.

Author: 钱毓婷

README.md

@@ -73,7 +73,7 @@
 | [070][070-question] | [Climbing Stairs][070-tips]                                  | [Easy][E]   | [✅][070-java] | [✅][070-js] | [✅][070-kotlin] |
 | [083][083-question] | [Remove Duplicates from Sorted List][083-tips]               | [Easy][E]   | [✅][083-java] | [✅][083-js] | [✅][083-kotlin] |
 | [088][088-question] | [Merge Sorted Array][088-tips]                               | [Easy][E]   | [✅][088-java] |              | [✅][088-kotlin] |
-| [100][100-question] | [Same Tree][100-tips]                                        | [Easy][E]   | [✅][100-java] |              | [✅][100-kotlin] |
+| [100][100-question] | [Same Tree][100-tips]                                        | [Easy][E]   | [✅][100-java] | [✅][100-js] | [✅][100-kotlin] |
 | [101][101-question] | [Symmetric Tree][101-tips]                                   | [Easy][E]   | [✅][101-java] |              | [✅][101-kotlin] |
 | [104][104-question] | [Maximum Depth of Binary Tree][104-tips]                     | [Easy][E]   | [✅][104-java] |              | [✅][104-kotlin] |
 | [107][107-question] | [Binary Tree Level Order Traversal II][107-tips]             | [Easy][E]   | [✅][107-java] |              | [✅][107-kotlin] |
@@ -378,6 +378,7 @@
 [069-js]: ./src/_069/Solution.js
 [070-js]: ./src/_070/Solution.js
 [083-js]: ./src/_083/Solution.js
+[100-js]: ./src/_100/Solution.js
 [226-js]: ./src/_226/Solution.js
 [561-js]: ./src/_561/Solution.js
 [643-js]: ./src/_643/Solution.js

src/_100/Solution.js

@@ -0,0 +1,20 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} p
+ * @param {TreeNode} q
+ * @return {boolean}
+ */
+var isSameTree = function(p, q) {
+    if(p == null && q == null) return true
+    if(p == null || q == null) return false
+    if(p.val == q.val) {
+        return isSameTree(p.left, q.left) && isSameTree(p.right, q.right)
+    }
+    return false
+};

tips/100/README.md

@@ -83,6 +83,28 @@ class Solution {
 }
 ```
 
+```javascript
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} p
+ * @param {TreeNode} q
+ * @return {boolean}
+ */
+var isSameTree = function(p, q) {
+    if(p == null && q == null) return true
+    if(p == null || q == null) return false
+    if(p.val == q.val) {
+        return isSameTree(p.left, q.left) && isSameTree(p.right, q.right)
+    }
+    return false
+};
+```
 ## 结语
 
 如果你同我们一样热爱数据结构、算法、LeetCode，可以关注我们 GitHub 上的 LeetCode 题解：[LeetCode-Solution][ls]