Suppose you are given a binary tree and a target sum. Is there a root-to-leaf path where the sum of the values along the path is equal to the target sum? If so, return true; otherwise, return false. A leaf is a node that has no children.

Suppose you are given a binary tree and a target sum. Is there a root-to-leaf path where the sum of the values along the path is equal to the target sum? If so, return true; otherwise, return false. A leaf is a node that has no children.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, hashedin, company-specific

目标公司: HashedIn

参考答案摘要

For example - Consider the below tree and target = 26. And we can see the path exists in the tree from 9 -> 7 -> 6 -> 4. This path to 26. So we need to return true. Solution - For the solution, we can...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。