摘要: Given a binary tree, flatten it to a linked list in-place. (Medium) For example,Given The flattened tree should look like: 分析: 将树的问题和链表插入问题结合。对于每个节点,寻 阅读全文
posted @ 2016-11-16 22:28 wangxiaobao1114 阅读(275) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.(Medium) For example:Given the below binary tree 阅读全文
posted @ 2016-11-16 22:24 wangxiaobao1114 阅读(224) 评论(0) 推荐(0) 编辑