0984bfcda21443b4b6bb8460aaa892df
(难度Easy) Problem 112. Path Sum(路径和)

Path Sum

Difficulty

Easy

Description

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.

题意

给定一棵带权重的二叉树,和一个整数int。要求是否存在一条从树根到叶子节点的路径,使得路径和等于给定的整数。

题解

显然,这也是一道搜索题。

top Created with Sketch.