2017年2月3日
Binary Tree Path Sum Lintcode
摘要： Given a binary tree, find all paths that sum of the nodes in the path equals to a given number target. A valid path is from root node to any of the le 阅读全文
posted @ 2017-02-03 09:52 璨璨要好好学习 阅读(208) 评论(0) 推荐(0)
Subtree with Maximum Average Lintcode
摘要： Given a binary tree, find the subtree with maximum average. Return the root of the subtree. Notice LintCode will print the subtree which root is your 阅读全文
posted @ 2017-02-03 08:59 璨璨要好好学习 阅读(1257) 评论(0) 推荐(0)
Lowest Common Ancestor III Lintcode
摘要： Given the root and two nodes in a Binary Tree. Find the lowest common ancestor(LCA) of the two nodes.The lowest common ancestor is the node with large 阅读全文
posted @ 2017-02-03 06:18 璨璨要好好学习 阅读(301) 评论(0) 推荐(0)
Path Sum III Leetcode
摘要： You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need t 阅读全文
posted @ 2017-02-03 04:12 璨璨要好好学习 阅读(208) 评论(0) 推荐(0)