实现算法求结点 x 在二叉树中的双亲结点

typedef struct TreeNode
{
    int data;
    struct TreeNode* lchild, * rchild;

}TreeNode, * Tree;
TreeNode* findparent(Tree T, int x)
{
    if (T != NULL) {

        if ((T->lchild && T->lchild->data == x) || (T->rchild && T->rchild->data == x)) {
            printf("%d\n", T->data);
        }

        TreeNode* parent = findparent(T->lchild, x);
        if (parent) {
            printf("%d\n", parent);
        }

        parent = findparent(T->rchild, x);
        printf("%d\n", parent);


    }
    else
        printf("not parent");
}