// You are given a binary tree in which each node contains a value. Design a lgorithm to print all paths which sum up to that value. Note that it can be any path in the tree - it does not have to start at the root. // 给定一棵二叉树，每个结点包含一个值。打印出所有满足以下