输入先序序列建立二叉树的问题 有人可以帮我看看嘛？T T

template <class T>
void BinaryTree<T>::CreateBinTree(T *CBT, int num,int rt,BinTreeNode<T> *& subTree){
if (rt < num){
if(CBT[rt++]=='#'){subTree = NULL;}
else {
subTree = new BinTreeNode<T>(CBT[rt]);
subTree->data=CBT[rt];
CreateBinTree(CBT, num,rt++,subTree->leftChild);// Create left child tree
CreateBinTree(CBT,num,rt++, subTree->rightChild);
}
}
}
出不来正确的结果