Path Sum III

Medium Binary Tree Path Problems

Count downward paths (from any node to a descendant) whose values sum to target. The tree is given in level order with # for missing children.

Constraints

0 <= nodes <= 1000

No discussions yet.