2020年3月10日
515. Find Largest Value in Each Tree Row
摘要： 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] # Definition for a binary tre 阅读全文
posted @ 2020-03-10 20:22 米开朗菠萝 阅读(135) 评论(0) 推荐(0)
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 / / \ 4 5 阅读全文
posted @ 2020-03-10 20:10 米开朗菠萝 阅读(120) 评论(0) 推荐(0)
404. Sum of Left Leaves
摘要： Find the sum of all left leaves in a given binary tree. Example: 3 / \ 9 20 / \ 15 7 There are two left leaves in the binary tree, with values 9 and 1 阅读全文
posted @ 2020-03-10 19:41 米开朗菠萝 阅读(142) 评论(0) 推荐(0)