判断二叉树是否为二叉排序树

int judgetree(BiTree T)
{
	if(T==NULL)	return 1;
    else{
        if(T->lchild!=NULL&&T->lchild->data>=T->data)
            return -1;
        if(T->rchild!=NULL&&T->rchild->data<=T->data)
            return -1;
        judgetree(T->rchild);
        judgetree(T->lchild);
    }
    return 1; //true
}