2017年5月9日
【Lintcode】069.Binary Tree Level Order Traversal
摘要： 题目： Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). Example Given binary tree {3 阅读全文
posted @ 2017-05-09 22:18 Vincent丶丶 阅读(171) 评论(0) 推荐(0) 编辑
【Lintcode】088.Lowest Common Ancestor
摘要： 题目： 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 阅读全文
posted @ 2017-05-09 21:35 Vincent丶丶 阅读(179) 评论(0) 推荐(0) 编辑
【Lintcode】094.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. Example Given the below binary tree: 1 / \ 2 3 阅读全文
posted @ 2017-05-09 20:58 Vincent丶丶 阅读(168) 评论(0) 推荐(0) 编辑