北邮OJ 二叉排序树
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/0fee6347e6cad3b41349d367b7385979.png)
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/5e92096cc08b2669811facbeb0a0e548.png)
#include <bits/stdc++.h>
using namespace std;
typedef struct node{
int data;
struct node* lchild;
struct node* rchild;
}Node;
Node* insert(Node* node,int x){
if(node==NULL){
node=(Node*)malloc(sizeof(Node));
node->data=x;
node->lchild=NULL;
node->rchild=NULL;
return node;
}
else if(x<node->data)
node->lchild=insert(node->lchild,x);
else if(x>=node->data)
node->rchild=insert(node->rchild,x);
return node;
}
void in(Node* node){
if(node){
in(node->lchild);
printf("%d",node->data);
in(node->rchild);
}
}
int find(Node* father,Node* node,int x){
if(node->data==x){
if(father==