update readme

Author: hogan-tech

.github/Question List.txt

@@ -10,4 +10,5 @@
 0787-cheapest-flights-within-k-stops python medium
 0997-find-the-town-judge python easy
 2092-find-all-people-with-secret python hard
-2709-greatest-common-divisor-traversal python hard
+2709-greatest-common-divisor-traversal python hard
+0100-same-tree python easy

README.md

@@ -95,6 +95,7 @@ The solutions are organized as follows:
 | 0095 | [Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)                                                                       | [Python](./0095-unique-binary-search-trees-ii/0095-unique-binary-search-trees-ii.py)                                                                                                                                                         | [Medium](./0095-unique-binary-search-trees-ii/README.md)                                  |
 | 0097 | [Interleaving String](https://leetcode.com/problems/interleaving-string/)                                                                                           | [Python](./0097-interleaving-string/0097-interleaving-string.py)                                                                                                                                                                             | [Medium](./0097-interleaving-string/README.md)                                            |
 | 0098 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)                                                                           | [Python](./0098-validate-binary-search-tree/0098-validate-binary-search-tree.py), [C++](./0098-validate-binary-search-tree/0098-validate-binary-search-tree.cpp)                                                                             | [Medium](./0098-validate-binary-search-tree/README.md)                                    |
+| 0100 | [Same Tree](https://leetcode.com/problems/same-tree/)                                                                                                               | [Python](./0100-same-tree/0100-same-tree.py)                                                                                                                                                                                                 | [Easy](./0100-same-tree/README.md)                                                        |
 | 0101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)                                                                                                     | [C++](./0101-symmetric-tree/0101-symmetric-tree.cpp)                                                                                                                                                                                         | [Easy](./0101-symmetric-tree/README.md)                                                   |
 | 0102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)                                                               | [Python](./0102-binary-tree-level-order-traversal/0102-binary-tree-level-order-traversal.py), [C++](./0102-binary-tree-level-order-traversal/0102-binary-tree-level-order-traversal.cpp)                                                     | [Medium](./0102-binary-tree-level-order-traversal/README.md)                              |
 | 0104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)                                                                         | [Python](./0104-maximum-depth-of-binary-tree/0104-maximum-depth-of-binary-tree.py), [C++](./0104-maximum-depth-of-binary-tree/0104-maximum-depth-of-binary-tree.cpp)                                                                         | [Easy](./0104-maximum-depth-of-binary-tree/README.md)                                     |