摘要：
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 / / \ 4 5 阅读全文
posted @ 2020-01-23 09:24
Schwifty
阅读(122)
评论(0)
推荐(0)
摘要：
You need to find the largest value in each row of a binary tree. Example: Input: 1 / \ 3 2 / \ \ 5 3 9 Output: [1, 3, 9] class Solution { public List< 阅读全文
posted @ 2020-01-23 09:13
Schwifty
阅读(152)
评论(0)
推荐(0)
摘要：
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 阅读全文
posted @ 2020-01-23 08:54
Schwifty
阅读(116)
评论(0)
推荐(0)
浙公网安备 33010602011771号