有序数组转二叉排序树

typedef struct node{
	int data;
	struct node* left;
	struct node* rigth;
}Node,*BTree;

void buildBiTree(BTree &T,int* a, int start, int end)
{
	if(start > end) return;
	int mid = start + (end - start)/2;
	if(T == NULL)
	{
		T = (Node*)malloc(sizeof(Node));
		T->data = a[mid];
		T->left = NULL;
		T->rigth = NULL;
	}
	buildBiTree(T->left,a,start,mid-1);
	buildBiTree(T->right,a,mid+1,end);	
}