2013年12月6日
[LeetCode]Binary Tree Maximum Path Sum
摘要： 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, 1 / \ 2 3Return6./** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode... 阅读全文
posted @ 2013-12-06 12:24 七年之后 阅读(174) 评论(0) 推荐(0) 编辑
[LeetCode]Maximum Depth of Binary Tree
摘要： 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 leaf node.思考：DFS。/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) ... 阅读全文
posted @ 2013-12-06 09:34 七年之后 阅读(151) 评论(0) 推荐(0) 编辑