2014年10月22日
[LeetCode] 111. Minimum 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 l 阅读全文
posted @ 2014-10-22 07:27 Grandyang 阅读(19067) 评论(5) 推荐(3)
[LeetCode] 113. Path Sum II 二叉树路径之和之二
摘要： 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 and sum 阅读全文
posted @ 2014-10-22 06:45 Grandyang 阅读(19171) 评论(6) 推荐(1)
Fork me on GitHub