"""This problem was asked by Uber.

Given a binary tree and an integer k, return whether there exists a root-to-leaf
path that sums up to k.

For example, given k = 18 and the following binary tree:

    8
   / \
  4   13
 / \   \
2   6   19
Return True since the path 8 -> 4 -> 6 sums to 18.
"""
c0a11488b03a7d7ca9cf918591da3f6dc775b413
<mask token>

"""This problem was asked by Uber.

Given a binary tree and an integer k, return whether there exists a root-to-leaf
path that sums up to k.

For example, given k = 18 and the following binary tree:

    8
   / \
  4   13
 / \   \
2   6   19
Return True since the path 8 -> 4 -> 6 sums to 18.
"""