摘要：
问题描述 You need to find the largest element in each row of a Binary Tree. Example: Input: 1 / \ 2 3 / \ \ 5 3 9 Output: [1, 3, 9] 算法分析 使用两个队列，逐层遍历二叉树的各个 阅读全文
摘要：
####问题描述 Given a binary tree, find the left most element in the last row of the tree. #####Example 1: Input: 2 / \ 1 3 Output: 1 #####Example 2: Input 阅读全文