|
- Path Sum - LeetCode
Path Sum - Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum
- Binary Tree Maximum Path Sum - LeetCode
A node can only appear in the sequence at most once Note that the path does not need to pass through the root The path sum of a path is the sum of the node's values in the path Given the root of a binary tree, return the maximum path sum of any non-empty path
- Path Sum II - LeetCode
Path Sum II - Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where the sum of the node values in the path equals targetSum
- Sum Root to Leaf Numbers - LeetCode
Can you solve this real interview question? Sum Root to Leaf Numbers - You are given the root of a binary tree containing digits from 0 to 9 only Each root-to-leaf path in the tree represents a number * For example, the root-to-leaf path 1 -> 2 -> 3 represents the number 123 Return the total sum of all root-to-leaf numbers
- Path Sum III - LeetCode
Path Sum III - Given the root of a binary tree and an integer targetSum, return the number of paths where the sum of the values along the path equals targetSum
- 1022. Sum of Root To Leaf Binary Numbers - LeetCode
Sum of Root To Leaf Binary Numbers - You are given the root of a binary tree where each node has a value 0 or 1 Each root-to-leaf path represents a binary number starting with the most significant bit
- Binary Tree Maximum Path Sum - LeetCode
A node can only appear in the sequence at most once Note that the path does not need to pass through the root The path sum of a path is the sum of the node's values in the path Given the root of a binary tree, return the maximum path sum of any non-empty path
- Binary Tree Paths - LeetCode
Can you solve this real interview question? Binary Tree Paths - Given the root of a binary tree, return all root-to-leaf paths in any order A leaf is a node with no children
|
|
|