2017年9月14日
LeetCode——Find Bottom Left Tree Value
摘要： Question Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Input: Output: 1 Example 2: Input: Output: 7 Note: You m 阅读全文
posted @ 2017-09-14 22:40 清水汪汪 阅读(227) 评论(0) 推荐(0)
LeetCode——Maximum Binary Tree
摘要： Question Given an integer array with no duplicates. A maximum tree building on this array is defined as follow: The root is the maximum number in the 阅读全文
posted @ 2017-09-14 20:14 清水汪汪 阅读(157) 评论(0) 推荐(0)