993.二叉树的堂兄弟节点

int finddepth(struct TreeNode* root,int n,int* father)
{
    if(root==NULL) return 0;
    if(root->val==n) return 1;
    if(root->left!=NULL&&root->left->val==n||root->right!=NULL&&root->right->val==n) (*father)=root->val;
    int left=finddepth(root->left,n,father);
    int right=finddepth(root->right,n,father);
    if(left!=0) return left+1;
    if(right!=0) return right+1;
    return 0;
}
/*void findfather(struct TreeNode* root,int n,int* father)
{
    if(root==NULL) return ;
    if(root->left!=NULL&&root->left->val==n||root->right!=NULL&&root->right->val=