§5.6.2根据广义表表示创建树 (二)广义表创建树的非递归算法 template <class TElem> TBin Tree Node0<TElem>*TBin Tree<TElem> GListToTree(long gList Exp, TElem*es, long numElem) TBinTreeNode<TElem>*p, rt, **S; long top, 1; if(num Elem<)return NULL s= new TBin TreeNode<TElem>*InumElem+1 if(s==NULL) throw TExcepComm(3)3 §5.6.2 根据广义表表示创建树 (二)广义表创建树的非递归算法 template <class TElem> TBinTreeNode0<TElem> *TBinTree<TElem>:: GListToTree(long *gListExp, TElem *es, long numElem) { TBinTreeNode<TElem> *p, *rt, **s; long top, i; if (numElem<2) return NULL; s = new TBinTreeNode<TElem> *[numElem+1]; if (s==NULL) throw TExcepComm(3);