在并查集中查找某个元素

此代码是数据结构的原始模板，可以刚接触或考研时借鉴下，不适于刷题
#include<stdio.h>
#include<malloc.h>
#define ERROR 0
#define OK 1
int nodenum;
typedef struct node
{
	int data;
	int parent;
}sqtree;
typedef struct code
{
   sqtree tree[100];
}bingcha,*bingchatree;
void initialization(bingchatree &ss,int elem[],int n)
{
	int i;
	nodenum=n;
	for(i=0;i<nodenum;i++)
	{
		ss->tree[i].data=elem[i];
		ss->tree[i].parent=-1;
	}
}
int find(bingchatree &ss,int x,int n)
{
	int pos,i;
	for(i=0;i<n;i++)
	{
		if(x==ss->tree[i].data)
		{
            pos=i;
			break;
		}
	}
    if(pos<0||pos>=n)
	return -1;
	i=pos;
	while(ss->tree[i].parent>0)
	i=ss->tree[i].parent;
	int root=i;
	i=pos;
	int temp;
	while(i!=root)
	{
		temp=ss->tree[i].parent;
		ss->tree[i].parent=root;
		i=temp;
	}
	return root;
}
int main()
{
	int n,elem[100];
	printf("请输入n个元素表示S中集合中元素的个数: ");
	scanf("%d",&n);
	printf("请输入各元素的值: ");
	for(int i=0;i<n;i++)
	scanf("%d",&elem[i]);
    bingchatree ss;
	ss=(bingchatree)malloc(sizeof(bingcha));
	initialization(ss,elem,n);
	int x,x1;
	printf("请输入一个S中的一个元素，在SS中查找该元素，并改进子集树: ");
	scanf("%d",&x);
	x1=find(ss,x,n);
	printf("%d\n",x1);
	return  0;
}