摘要：
You need to find the largest value in each row of a binary tree. Example: 阅读全文
posted @ 2019-04-16 12:48
PJCK
阅读(104)
评论(0)
推荐(0)
摘要：
Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Example 2: Note: You may assume the tree (i.e., the given root no 阅读全文
posted @ 2019-04-16 12:28
PJCK
阅读(113)
评论(0)
推荐(0)
摘要：
Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文
posted @ 2019-04-16 09:24
PJCK
阅读(129)
评论(0)
推荐(0)
摘要：
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l 阅读全文
posted @ 2019-04-16 09:20
PJCK
阅读(138)
评论(0)
推荐(0)
浙公网安备 33010602011771号