public void findSumWithoutRoot(TreeNode root,int sum,ArrayList<Integer> buffer,int level){
		if(root == null)
			return ;
		buffer.add(level, root.data);
		int tmp = 0;
		for(int i = level;i>0;i--){
			tmp += buffer.get(level);
			if(tmp == sum){
				print(buffer);
			}
		}
		ArrayList<Integer> left = (ArrayList<Integer>) buffer.clone();
		ArrayList<Integer> right = (ArrayList<Integer>) buffer.clone();
		findSumWithoutRoot(root.left,sum,left,level++);
		findSumWithoutRoot(root.right,sum,right,level++);
	}