查看一颗二叉树从根到叶子路径的节点和是否等于某个给定的数

package tree;

public class Roottoeafpathsumequaltoagivennumber {

	/**
	 * 查看一颗二叉树从根到叶子路径的节点和是否等于某个给定的数
	 * @param args
	 */
	public static boolean isexit(TreeNode root,int num,int sum){
		if(root==null) return false;
		sum+=root.value;
		if(root.left==null&&root.right==null){
			if(sum==num){
				return true;
			}
			sum -= root.value;
		}
		boolean flag = isexit(root.left, num, sum);
		if(!flag){
			return isexit(root.right, num, sum);
		}
		return flag;
	}
	public static void main(String[] args) {
		
		TreeNode root = new TreeNode(10);
		root.left = new TreeNode(8);
		root.right = new TreeNode(2);
		root.left.left = new TreeNode(3);
		root.left.right = new TreeNode(5);
		root.right.left = new TreeNode(2);
		System.out.println(isexit(root, 27, 0));

	}

}