【LeetCode & 剑指offer刷题】树题9：34 二叉树中和为某一值的路径（112. Path Sum）...

【LeetCode & 剑指offer刷题】树题9：34 二叉树中和为某一值的路径（112. Path Sum）

【LeetCode & 剑指offer 刷题笔记】目录（持续更新中...）

112. Path Sum

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.

Note:  A leaf is a node with no children.

Example:

Given the below binary tree and   sum = 22 ,

     5

    / \

   4    8

   /    / \

  11 13   4

 / \        \

7   2         1

return true, as there exist a root-to-leaf path   5->4->11->2   which sum is 22.

 

/**

 * Definition for a binary tree node.

 * struct TreeNode {

 *     int val;

 *     TreeNode *left;

 *     TreeNode *right;

 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}

 * };

 */

/*

只要求返回true或false,因此不需要记录路径

*/

class