Tree

Tagged

A collection of 2 posts

Binary Tree Path Sum

LintCode-376. Binary Tree Path Sum 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 leaf nodes. Example: Given a binary tree, and target = 5: 1 / \ 2 4

LintCode

Construct Binary Tree from Inorder and Postorder Traversal

LintCode-72.Construct Binary Tree from Inorder and Postorder Traversal Given inorder and postorder traversal of a tree, construct the binary tree. Notice: You may assume that duplicates do not exist in the tree. Given inorder [1,2,3] and postorder [1,3,2], return a tree: 2 / \ 1 3 /** * Definition