Binary Tree Operations(II) - Path Sum and Cycle Detection

This is the second article on binary tree operations. For topics on binary tree build, traversal and comparison, please refer to Binary Tree Operations(I)

1. Path Sum
2. Build Binary Tree With Cycle
3. Detect Cycle in Binary Tree

1. Path Sum

The Path Sum problem of binary tree is:

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.

- See more at: http://bo-yang.github.io/2014/08/16/binary-tree-ii/#sthash.GmHRUGxv.dpuf

http://bo-yang.github.io/2014/08/16/binary-tree-ii