113. Path Sum II

Posted 2021-12-06 chucklu

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了113. 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]
]

以上是关于113. Path Sum II的主要内容，如果未能解决你的问题，请参考以下文章