- 博客(2)
- 收藏
- 关注
RSS订阅原创 [leetcode] 513. Find Bottom Left Tree Value
Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Input: 2 / \ 1 3 Output: 1 Example 2: Input: 1 / \ 2 3
2017-02-27 17:06:27
453
原创 [leetcode] 508. Most Frequent Subtree Sum
Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (includi
2017-02-07 16:28:33
1096
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人