求二叉树某个结点的路径

public class Main{
	public static class TreeNode {
	      int val;
	      TreeNode left;
	      TreeNode right;
	      TreeNode(int x) { val = x; }
	}
	public static void search(TreeNode T, TreeNode p, LinkedList<TreeNode> path) {
		path.add(T);
		//当前T即为p，不用再继续往下找了
		if(path.getLast()==p) {
			return;
		}
		// 条件 path.getLast()!=p 作用: 约束 p 的各位祖先T结点，
		// 如果当前T不为p，如果已经找到p了，就不再继续找了，也不应删除该祖先T
		if(T.left!=null && path.getLast()!=p) {
			System.out.println("left结点："+T.left.val);
			search(T.left, p, path);
		}
		if(T.right!=null && path.getLast()!=p) {
			System.out.println("right结点："+T.right.val);
			search(T.right, p, path);
		}
		if(path.getLast()!=p) {
			path.remove(T);
		}
	}

	//满二叉树，根结点索引为0
	public static TreeNode initFullBinaryTree(int height, ArrayList<TreeNode> al) {
		// 结点总数
		int size = (int)Math.pow(2, height) - 1;
		for(int i=0; i<size; ++i) {
			al.add(new TreeNode(i));
		}
		// 第一个叶子节点的索引
		int firstLeafIndex = (int)Math.pow(2, height-1)-1;
		for(int i=0; i<firstLeafIndex; ++i) {
			al.get(i).left = al.get(i*2+1);
			al.get(i).right = al.get(i*2+2);
		}
		return al.get(0);
	}
	public static void main(String[] args) {
		ArrayList<TreeNode> al = new ArrayList<>();
		TreeNode root = initFullBinaryTree(4, al);
		TreeNode p = al.get(3);
		LinkedList<TreeNode> path = new LinkedList<>();
		search(root, p, path);
		for(TreeNode tn : path)
			System.out.println(tn.val);
	}
}