剑指offer25 二叉树某一路径的和为设定的值

import java.util.Stack;

public class Test{
public static void find(Btree root,int sum) {
if(rootnull)return;
Stack path=new Stack<>();
int currentSum=0;
find(root,sum,path,currentSum);
}
public static void find(Btree root,int sum,Stack path,int currentSum) {
path.push(root.data);
currentSum+=root.data;
boolean isLeaf=root.leftnull&&root.rightnull;
if(currentSumsum&&isLeaf) {
System.out.println(path);
}
if(root.left!=null) {
find(root.left, sum, path, currentSum);
}
if(root.right!=null) {
find(root.right, sum, path, currentSum);
}
path.pop();
currentSum-=root.data;
}
public static void main(String[] args) {
Btree A1 = new Btree(1);
Btree A2 = new Btree(2);
Btree A3 = new Btree(3);
Btree A4 = new Btree(4);
Btree A5 = new Btree(1);
A1.left = A2;
A1.right = A3;
A2.left = A4;
A2.right = A5;
find(A1, 4);
}

}
class Btree{
int data;
Btree left,right;
Btree(int x){
data=x;
}
}