摘要：
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example:Given the below binary tree andsum 阅读全文
posted @ 2017-06-10 22:40
王大咩的图书馆
阅读(357)
评论(0)
推荐(0)
摘要：
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. F 阅读全文
posted @ 2017-06-10 21:24
王大咩的图书馆
阅读(373)
评论(0)
推荐(0)
摘要：
Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For example:Given the below binary tree, Return6. 阅读全文
posted @ 2017-06-10 21:03
王大咩的图书馆
阅读(300)
评论(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 @ 2017-06-10 16:46
王大咩的图书馆
阅读(329)
评论(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 @ 2017-06-10 15:35
王大咩的图书馆
阅读(358)
评论(1)
推荐(0)
浙公网安备 33010602011771号