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