leetcode_112. Path Sum 二叉樹路徑求和，判斷是否存在路徑和爲某個值的路徑，深度遍歷，遞歸的return

題目：node Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.算法 For example: Given the below binary tree

>>阅读原文<<