当前标签：二叉树

construct-binary-tree-from-inorder-and-postorder-traversal

Adding 2016-05-23 08:59 阅读:175 评论:0 推荐:0

construct-binary-tree-from-preorder-and-inorder-traversal

Adding 2016-05-22 21:18 阅读:132 评论:0 推荐:0

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example: Given the below binary tree andsum =

Adding 2016-05-20 11:33 阅读:172 评论:0 推荐:0

Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number. An example is the root-to-leaf path1->2->3which represents the number123. Find the total sum of a

Adding 2016-05-19 14:34 阅读:133 评论:0 推荐:0