|
30 | 30 | -[144. 二叉树的前序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/14)✅ |
31 | 31 | -[145. 二叉树的后序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/15)✅ |
32 | 32 | -[100. 相同的树](https://github.com/Geekhyt/javascript-leetcode/issues/16)✅ |
33 | | --[101. 对称二叉树](https://github.com/Geekhyt/javascript-leetcode/issues/17) |
| 33 | +-[101. 对称二叉树](https://github.com/Geekhyt/javascript-leetcode/issues/17)✅ |
34 | 34 | -[102. 二叉树的层序遍历](https://github.com/Geekhyt/javascript-leetcode/issues/18) |
35 | 35 | -[104. 二叉树的最大深度](https://github.com/Geekhyt/javascript-leetcode/issues/19)✅ |
36 | 36 | -[226. 翻转二叉树](https://github.com/Geekhyt/javascript-leetcode/issues/20)✅ |
|