add js solution to leetcode problem: no.100

tchx626 · tchx626 · commit 7458a3a8b56c · 2021-05-14T19:10:25.000+08:00
diff --git a/solution/0100-0199/0100.Same Tree/README.md b/solution/0100-0199/0100.Same Tree/README.md
@@ -144,6 +144,31 @@ func isSameTree(p *TreeNode, q *TreeNode) bool {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} p
+ * @param {TreeNode} q
+ * @return {boolean}
+ */
+var isSameTree = function (p, q) {
+    if (!p && !q) return true;
+    if (p && q) {
+        return (p.val === q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right))
+    }
+    return false;
+};
+```
+
 ### **...**
 
 ```
diff --git a/solution/0100-0199/0100.Same Tree/README_EN.md b/solution/0100-0199/0100.Same Tree/README_EN.md
@@ -134,6 +134,31 @@ func isSameTree(p *TreeNode, q *TreeNode) bool {
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} p
+ * @param {TreeNode} q
+ * @return {boolean}
+ */
+var isSameTree = function (p, q) {
+    if (!p && !q) return true;
+    if (p && q) {
+        return (p.val === q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right))
+    }
+    return false;
+};
+```
+
 ### **...**
 
 ```
diff --git a/solution/0100-0199/0100.Same Tree/Solution.js b/solution/0100-0199/0100.Same Tree/Solution.js
@@ -0,0 +1,20 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} p
+ * @param {TreeNode} q
+ * @return {boolean}
+ */
+ var isSameTree = function (p, q) {
+    if (!p && !q) return true;
+    if (p && q) {
+        return (p.val === q.val && isSameTree(p.left, q.left) && isSameTree(p.right, q.right))
+    }
+    return false;
+};
