Merge pull request #21 from fartem/100_Same_Tree

2023-02-11 update: added "100. Same Tree"

Author: fartem

README.md

@@ -30,3 +30,4 @@ Profile on LeetCode: [fartem](https://leetcode.com/fartem/).
 | 83. Remove Duplicates from Sorted List | [Link](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | [Link](./lib/easy/remove_duplicates_from_sorted_list.dart) |
 | 88. Merge Sorted Array                 | [Link](https://leetcode.com/problems/merge-sorted-array/)                 | [Link](./lib/easy/merge_sorted_array.dart)                 |
 | 94. Binary Tree Inorder Traversal      | [Link](https://leetcode.com/problems/binary-tree-inorder-traversal/)      | [Link](./lib/easy/binary_tree_inorder_traversal.dart)      |
+| 100. Same Tree                         | [Link](https://leetcode.com/problems/same-tree/)                          | [Link](./lib/easy/same_tree.dart)                          |

lib/easy/same_tree.dart

@@ -0,0 +1,14 @@
+import '../common/tree_node.dart';
+
+// https://leetcode.com/problems/same-tree/
+class Solution {
+  bool isSameTree(TreeNode? p, TreeNode? q) {
+    if (p != null && q != null) {
+      if (p.val != q.val) {
+        return false;
+      }
+      return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
+    }
+    return p == null && q == null;
+  }
+}

test/easy/same_tree_test.dart

@@ -0,0 +1,64 @@
+import 'package:leetcode_dart/common/tree_node.dart';
+import 'package:leetcode_dart/easy/same_tree.dart';
+import 'package:test/test.dart';
+
+void main() {
+  group(
+    'Example tests',
+    () {
+      final st = Solution();
+      test(
+        'true',
+        () => expect(
+          true,
+          st.isSameTree(
+            TreeNode(
+              1,
+              TreeNode(2),
+              TreeNode(3),
+            ),
+            TreeNode(
+              1,
+              TreeNode(2),
+              TreeNode(3),
+            ),
+          ),
+        ),
+      );
+      test(
+        'false',
+        () => expect(
+          false,
+          st.isSameTree(
+              TreeNode(
+                1,
+                TreeNode(2),
+              ),
+              TreeNode(
+                1,
+                null,
+                TreeNode(2),
+              )),
+        ),
+      );
+      test(
+        'false',
+        () => expect(
+          false,
+          st.isSameTree(
+            TreeNode(
+              1,
+              TreeNode(2),
+              TreeNode(1),
+            ),
+            TreeNode(
+              1,
+              TreeNode(1),
+              TreeNode(2),
+            ),
+          ),
+        ),
+      );
+    },
+  );
+}