Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to content

Commit 19f1289

Browse files
committed
增加部分总结
1 parent 5b116a3 commit 19f1289

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -68,8 +68,8 @@
6868
| No94 | [94. 二叉树的中序遍历](https://leetcode-cn.com/problems/binary-tree-inorder-traversal/) | [java](https://github.com/Programming-With-Love/leetcode/blob/master/leetcode/Tree/No94.java) | 直接使用递归解决。 |
6969
| No404 | [404. 左叶子之和](https://leetcode-cn.com/problems/sum-of-left-leaves/) | [java](https://github.com/Programming-With-Love/leetcode/blob/master/leetcode/Tree/No404.java) | 可以参考全路径求和方法,增加判断条件 true 和false。 |
7070
| No606 | [606. 根据二叉树创建字符串](https://leetcode-cn.com/problems/construct-string-from-binary-tree/) | [java](https://github.com/Programming-With-Love/leetcode/blob/master/leetcode/Tree/No606.java) | 递归,根据是否为“”来判断采用什么样的方式。(左右节点是否为空所带来的字符串不一样) |
71-
| | | | |
72-
| | | | |
71+
| No637 | [637. 二叉树的层平均值](https://leetcode-cn.com/problems/average-of-levels-in-binary-tree/) | [java](https://github.com/Programming-With-Love/leetcode/blob/master/leetcode/Tree/No637.java) | 采用队列的方式解决。 |
72+
| No653 | [653. 两数之和 IV - 输入 BST](https://leetcode-cn.com/problems/two-sum-iv-input-is-a-bst/) | [java](https://github.com/Programming-With-Love/leetcode/blob/master/leetcode/Tree/No653.java) | |
7373
| | | | |
7474
| | | | |
7575
| | | | |

0 commit comments

Comments
 (0)