本文共 369 字，大约阅读时间需要 1 分钟。

This is the second article on binary tree operations. For topics on binary tree build, traversal and comparison, please refer to 

1. 

The  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.

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

转载地址：http://mfpvb.baihongyu.com/