find_root(A[],n)//n is the number of elements
{
	int i = 0;
	Node* curroot = A[0];
	for(i = 1;i < n;i++)
		if(A[i] -> left == curroot)
			curroot = A[i];
	return curroot;
}