void locate(BitTree t, int x)//在二叉树t中查找值为x的结点{BitTree p;p=t;if (t == NULL)printf("0\n");else if( t->data == x)printf("%d\n",p->data);else{ p=t->lchild;if (p)locate(t->lchild, x);elselocate(t->rchild, x);}}
再分享一下我老师大神的人工智能教程吧。零基础!通俗易懂!风趣幽默!还带黄段子!希望你也加入到我们人工智能的队伍中来!https://blog.csdn.net/jiangjunshow