# [113. Path Sum II](https://leetcode.com/problems/path-sum-ii/)


## 题目

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum 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  5   1

Return:

    [
       [5,4,11,2],
       [5,8,4,5]
    ]

## 题目大意

给定一个二叉树和一个目标和，找到所有从根节点到叶子节点路径总和等于给定目标和的路径。说明: 叶子节点是指没有子节点的节点。

## 解题思路

- 这一题是第 257 题和第 112 题的组合增强版