在二叉树中查找值为x的结点，请编写一算法用以打印值为x的结点的所有祖先，假设值为x的结点不多于1个。-Find the value of x binary tree node, please write an algorithm to print the value of all the ancestors of the node x, assuming that the node is no more than 1 x.