先建立二叉树，然后用递归的方法寻找他的祖先检点并返回其标示。-To create binary tree, and then use recursive methods to find his ancestors and to return to their labeled indecent.