Root-to-Leaf Path Sum

A binary tree is given in level order, with # for a missing child (children of missing nodes are not listed). Print YES if some root-to-leaf path sums to target.

1 <= nodes <= 5000