2013年2月14日
Path Sum
摘要： 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.For example:Given the below binary tree andsum = 22, 5 / \ 4 8 / / \ 11 13 4 / \ ... 阅读全文
posted @ 2013-02-14 18:59 一只会思考的猪 阅读(140) 评论(0) 推荐(0) 编辑
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./** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x... 阅读全文
posted @ 2013-02-14 18:46 一只会思考的猪 阅读(109) 评论(0) 推荐(0) 编辑
Minimun depth of Binary Tree
摘要： 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 leaf node./** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x... 阅读全文
posted @ 2013-02-14 18:43 一只会思考的猪 阅读(215) 评论(0) 推荐(0) 编辑