2018年1月29日
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 @ 2018-01-29 22:04 乐乐章 阅读(162) 评论(0) 推荐(0)
106. Construct Binary Tree from Inorder and Postorder Traversal(注意与105差别，下标)
摘要： Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For example, 阅读全文
posted @ 2018-01-29 21:15 乐乐章 阅读(207) 评论(0) 推荐(0)