有人会编这个程序嘛？？有关二叉排序树的

行云流水 · 发表于 2002-11-14 16:43:54

马上注册，结交更多好友，享用更多功能，让你轻松玩转社区。

您需要登录才可以下载或查看，没有帐号？注册

x

假定一棵二叉排序树被存储在具有ABTLIST数组类型的一个对象BST中，试编写出以下算法：
1。初始化对象BST
2。向二叉排序树中插入一个元素
3。根据数组A中的N个元素建立一棵二叉排序树
4.中序遍历二叉排序树
5。写出一个完整程序调用上诉算法

酒狐 · 发表于 2002-11-19 09:53:31

谢了！

FIGO · 发表于 2002-11-18 19:46:26

小子够懒的啊．

行云流水 · 发表于 2002-11-17 21:48:37

不会这么难吧？？
我们老师真抠！

雪浪 · 发表于 2002-11-17 21:13:23

//---------------------------------------------------------------------------

#include <iostream.h>

#include "tree.h"
#include "comm.h"
template <class TElem>
TBinTree<TElem>::TBinTree()
{
root=NULL;
numNodes=0;
}

template <class TElem>
TBinTree<TElem>::~TBinTree()
{
ReleaseSubs(root);
}

template <class TElem>
long TBinTree<TElem>::ReleaseSubs(TBinTreeNode0<TElem> *pRoot)
{
long cnt=0;

if (pRoot->GetSon(1)==NULL && pRoot->GetSon(2)==NULL)
{
  delete pRoot;
  return 1;
}
if (pRoot->GetSon(1)!=NULL) cnt=ReleaseSubs(pRoot->GetSon(1));
else cnt=ReleaseSubs(pRoot->GetSon(2));

delete pRoot;
return cnt+1;

}

template <class TElem>
long TBinTree<TElem>::GetLevel(TBinTreeNode0<TElem> *pRoot)
{
if (pRoot==NULL) return 0;
return GetLevel(pRoot->GetFather())+1;

}

template <class TElem>
long TBinTree<TElem>::GetHeight(TBinTreeNode0<TElem> *pRoot)
{
long m1, m2;

if (pRoot==NULL) return 0;
m1 = GetHeight(pRoot->GetSon(1));
m2 = GetHeight(pRoot->GetSon(2));
if (m1>m2) return m1+1;
else return m2+1;
}

template <class TElem>
long TBinTree<TElem>::GetNumSubNodes(TBinTreeNode0<TElem> *pRoot)
{
long m1, m2;

if (pRoot==NULL) return 0;
m1 = GetNumSubNodes(pRoot->GetSon(1));
m2 = GetNumSubNodes(pRoot->GetSon(2));
return m1+m2+1;
}

template <class TElem>
long TBinTree<TElem>::GetNumSubNodes(void)
{
return numNodes;
}

template <class TElem>
long TBinTree<TElem>::GetNumLeaves(TBinTreeNode0<TElem> *pRoot)
{
long m1, m2;

if (pRoot==NULL) return 0;
if (pRoot->IsLeaf()) return 1;
m1 = GetNumLeaves(pRoot->GetSon(1));
m2 = GetNumLeaves(pRoot->GetSon(2));
return m1+m2;
}

template <class TElem>
long TBinTree<TElem>::Cluster(TBinTreeNode0<TElem>* pNode, TElem ** e,TTraverseMode tm)
{
static long cnt=0;

if (pNode==NULL) return 0;

switch (tm)
{
  case PreOrder:
e[cnt++]=&(pNode->GetElem());
Cluster(pNode->GetSon(1), e,tm);
Cluster(pNode->GetSon(2), e,tm);
return cnt;

  case InOrder:
Cluster(pNode->GetSon(1), e,tm);
e[cnt++]=&(pNode->GetElem());
Cluster(pNode->GetSon(2), e,tm);
return cnt;

  case PostOrder:
Cluster(pNode->GetSon(1), e,tm);
Cluster(pNode->GetSon(2), e,tm);
e[cnt++]=&(pNode->GetElem());
return cnt;
}
return 0;
}

template <class TElem>
long TBinTree<TElem>::Cluster(TBinTreeNode0<TElem>* pNode, TBinTreeNode0<TElem> **pNodes,TTraverseMode tm)
{
static long cnt=0;

if (pNode==NULL) return 0;

switch (tm)
{
  case PreOrder:
pNodes[cnt++]=pNode;
Cluster(pNode->GetSon(1), pNodes,tm);
Cluster(pNode->GetSon(2), pNodes,tm);
return cnt;

  case InOrder:
Cluster(pNode->GetSon(1), pNodes,tm);
pNodes[cnt++]=pNode;
Cluster(pNode->GetSon(2), pNodes,tm);
return cnt;

  case PostOrder:
Cluster(pNode->GetSon(1), pNodes,tm);
Cluster(pNode->GetSon(2), pNodes,tm);
pNodes[cnt++]=pNode;
return cnt;
}
return 0;
}

template <class TElem>
long TBinTree<TElem>::Cluster2(TBinTreeNode0<TElem>* pNode, TBinTreeNode0<TElem> **pNodes,TTraverseMode tm)
{
long cnt=0;
long nNodes;
long top=0;
TBinTreeNode<TElem>** sk;
TBinTreeNode<TElem>* p;

nNodes=GetHeight(pNode);
if (nNodes<=0) return 0;

switch (tm)
{
  case PreOrder:

sk =new TBinTreeNode<TElem> *[nNodes+1];
if (sk==NULL) throw TExcepComm(3);

p  =(TBinTreeNode<TElem> *) pNode;
while (p!=NULL || top!=0)
{
   if (p!=NULL)
   {
   pNodes[cnt++]= p;
   top++; sk[top]=p;
   p = (TBinTreeNode<TElem> *)p->GetSon(1);
   }
   else
   {
   p = sk[top]; top--;
   p = (TBinTreeNode<TElem> *)p->GetSon(2);
   }
} //while
delete[] sk;
break;

  case InOrder:
sk =new TBinTreeNode<TElem> *[nNodes+1];
if (sk==NULL) throw TExcepComm(3);

p  =(TBinTreeNode<TElem> *) pNode;
while (p!=NULL || top!=0)
{
   if (p!=NULL)
   {
   top++; sk[top]=p;
   p = (TBinTreeNode<TElem> *)p->GetSon(1);
   }
   else
   {
   p = sk[top]; top--;
   pNodes[cnt++]= p;
   p = (TBinTreeNode<TElem> *)p->GetSon(2);
   }
} //while
delete[] sk;
break;

  case PostOrder:
if (pNode==NULL) return 0;

struct TPostTraverseStackNode
{
   TBinTreeNode<TElem> *pNode;
   char isFirst;
} ;

TPostTraverseStackNode *sk2;

sk2 =new TPostTraverseStackNode [nNodes+1];
if (sk2==NULL) throw TExcepComm(3);

p  =(TBinTreeNode<TElem> *) pNode;
while (p!=NULL || top!=0)
{
   if (p!=NULL)
   {
   top++;
   sk2[top].pNode=p;
   sk2[top].isFirst = 1;
   p = (TBinTreeNode<TElem> *)p->GetSon(1);
   }
   else
   if (sk2[top].isFirst)
   {
   sk2[top].isFirst = 0;
   p = (TBinTreeNode<TElem> *)(sk2[top].pNode->GetSon(2));
   }
   else
   {
   p = sk2[top].pNode;
   top--;
   pNodes[cnt++]= p;
   p=NULL;
   }
} //while
  delete [] sk2;
  break;
}

return cnt;
}

template <class TElem>
long TBinTree<TElem>::ClusterDescendants(TBinTreeNode0<TElem>* pNode,
TBinTreeNode0<TElem>** pNodes,
TTraverseMode tm,
int startLevel,
int endLevel)
{
long cnt=0, levelNo=0;
long nNodes;
long top=0;
TBinTreeNode<TElem>* p;

nNodes=GetHeight(pNode);
if (nNodes<=0) return 0;

struct TTraverseStackNode
{
TBinTreeNode<TElem> *pNode;
long levelNo;
char isFirst;
} ;

TTraverseStackNode *sk2;

sk2 =new TTraverseStackNode [nNodes+1];
if (sk2==NULL) throw TExcepComm(3);

if (startLevel<0) startLevel = nNodes+startLevel+1;
if (endLevel<0) endLevel = nNodes+endLevel+1;

switch (tm)
{
  case PreOrder:

levelNo=1;
p  =(TBinTreeNode<TElem> *) pNode;
while (p!=NULL || top!=0)
{
   if (p!=NULL)
   {
   top++;
   sk2[top].pNode=p;
   sk2[top].levelNo=levelNo;
   if (levelNo>=startLevel && levelNo<=endLevel)
      pNodes[cnt++]= p;
   p = (TBinTreeNode<TElem> *)p->GetSon(1);
   if (p!=NULL)  levelNo++;
   }
   else
   {
   p = sk2[top].pNode;
   levelNo=sk2[top].levelNo;
   top--;
   p = (TBinTreeNode<TElem> *)p->GetSon(2);
   if (p!=NULL) levelNo++;
   }
} //while
delete[] sk2;
break;

  case InOrder:

levelNo=1;
p  =(TBinTreeNode<TElem> *) pNode;
while (p!=NULL || top!=0)
{
   if (p!=NULL)
   {
   top++;
   sk2[top].pNode=p;
   sk2[top].levelNo=levelNo;
   p = (TBinTreeNode<TElem> *)p->GetSon(1);
   if (p!=NULL)  levelNo++;
   }
   else
   {
   p = sk2[top].pNode;
   levelNo=sk2[top].levelNo;
   top--;
   if (levelNo>=startLevel && levelNo<=endLevel)
      pNodes[cnt++]= p;
   p = (TBinTreeNode<TElem> *)p->GetSon(2);
   if (p!=NULL) levelNo++;
   }
} //while
delete[] sk2;
break;

  case PostOrder:

levelNo=1;
p  =(TBinTreeNode<TElem> *) pNode;
while (p!=NULL || top!=0)
{
   if (p!=NULL)
   {
   top++;
   sk2[top].pNode=p;
   sk2[top].levelNo = levelNo;
   sk2[top].isFirst = 1;
   p = (TBinTreeNode<TElem> *)p->GetSon(1);
   if (p!=NULL) levelNo++;
   }
   else
   if (sk2[top].isFirst)
   {
   sk2[top].isFirst = 0;
   p = (TBinTreeNode<TElem> *)(sk2[top].pNode->GetSon(2));
   levelNo = sk2[top].levelNo;
   if (p!=NULL) levelNo++;
   }
   else
   {
   p = (TBinTreeNode<TElem> *)sk2[top].pNode;
   levelNo = sk2[top].levelNo;
   top--;
   if (levelNo>=startLevel && levelNo<=endLevel)
      pNodes[cnt++]= p;
   p=NULL;
   }
} //while

  delete[] sk2;
  break;
}

return cnt;
}

template <class TElem>
long TBinTree<TElem>::ClusterAncestors(TElem &e, TBinTreeNode0<TElem>** pNodes)
{
long top, hei;

TBinTreeNode<TElem> *p, *rt;

struct TTraverseStackNode
{
TBinTreeNode<TElem> *pNode;
long levelNo;
char isFirst;
} ;

TTraverseStackNode *sk2;

rt =(TBinTreeNode<TElem>*) GetRoot();
hei=GetHeight(rt);
if (hei<=0) return 0;
sk2 =new TTraverseStackNode[hei+1];
if (sk2==NULL) throw TExcepComm(3);

p  = rt;
top=0;
while (p!=NULL || top!=0)
{
  if (p!=NULL)
  {
top++;
sk2[top].pNode=p;
sk2[top].isFirst = 1;
if (p->GetElem()==e) break;
p = (TBinTreeNode<TElem> *)p->GetSon(1);
  }
  else
  if (sk2[top].isFirst)
  {
sk2[top].isFirst = 0;
p = (TBinTreeNode<TElem> *)(sk2[top].pNode->GetSon(2));
  }
  else
  {
p = sk2[top].pNode;
top--;
p=NULL;
  }
} //while

for (long i=1; i<=top; i++)
pNodes[i-1]=sk2.pNode;
delete [] sk2;

return top;
}

template <class TElem>
long TBinTree<TElem>::ClusterAncestors(TBinTreeNode0<TElem>* pNode, TBinTreeNode0<TElem>** pNodes)
{
long top, hei;

TBinTreeNode<TElem> *p, *rt;

struct TTraverseStackNode
{
TBinTreeNode<TElem> *pNode;
long levelNo;
char isFirst;
} ;

TTraverseStackNode *sk2;

rt =(TBinTreeNode<TElem>*) GetRoot();
hei=GetHeight(rt);
if (hei<=0) return 0;
sk2 =new TTraverseStackNode[hei+1];
if (sk2==NULL) throw TExcepComm(3);

p  = rt;
top=0;
while (p!=NULL || top!=0)
{
  if (p!=NULL)
  {
top++;
sk2[top].pNode=p;
sk2[top].isFirst = 1;
if (p==pNode) break;
p = (TBinTreeNode<TElem> *)p->GetSon(1);
  }
  else
  if (sk2[top].isFirst)
  {
sk2[top].isFirst = 0;
p = (TBinTreeNode<TElem> *)(sk2[top].pNode->GetSon(2));
  }
  else
  {
p = sk2[top].pNode;
top--;
p=NULL;
  }
} //while

for (long i=1; i<=top; i++)
pNodes[i-1]=sk2.pNode;
delete [] sk2;

return top;

}

template <class TElem>
long TBinTree<TElem>::ClusterAncestors(TBinTreeNode0<TElem>* pNode, TElem **e)
{
long top, hei;

TBinTreeNode<TElem> *p, *rt;

struct TTraverseStackNode
{
TBinTreeNode<TElem> *pNode;
long levelNo;
char isFirst;
} ;

TTraverseStackNode *sk2;

rt =(TBinTreeNode<TElem>*) GetRoot();
hei=GetHeight(rt);
if (hei<=0) return 0;
sk2 =new TTraverseStackNode[hei+1];
if (sk2==NULL) throw TExcepComm(3);

p  = rt;
top=0;
while (p!=NULL || top!=0)
{
  if (p!=NULL)
  {
top++;
sk2[top].pNode=p;
sk2[top].isFirst = 1;
if (p==pNode) break;
p = (TBinTreeNode<TElem> *)p->GetSon(1);
  }
  else
  if (sk2[top].isFirst)
  {
sk2[top].isFirst = 0;
p = (TBinTreeNode<TElem> *)(sk2[top].pNode->GetSon(2));
  }
  else
  {
p = sk2[top].pNode;
top--;
p=NULL;
  }
} //while

for (long i=1; i<=top; i++)
e[i-1]=&(sk2.pNode->GetElem());
delete [] sk2;

return top;

}

template <class TElem>
long TBinTree<TElem>::ClusterJuniors(TBinTreeNode0<TElem>* pNode,
TBinTreeNode0<TElem> **pe,
TTraverseMode tm,
int startLevel,
int endLevel)
{
long levelNo, hei;

TBinTreeNode<TElem> *rt;
rt =(TBinTreeNode<TElem> *) GetRoot();

if (startLevel<0 || endLevel<0)
hei = GetHeight(rt);
if (startLevel<0) startLevel = hei+startLevel+1;
if (endLevel<0) endLevel = hei+endLevel+1;

levelNo = GetLevel(pNode);
if (levelNo<=0) return 0;

startLevel = levelNo+startLevel-1;
endLevel = levelNo+endLevel-1;

return  ClusterDescendants(rt, pe, tm, startLevel, endLevel );

}

template <class TElem>
long TBinTree<TElem>::ClusterSeniors(TBinTreeNode0<TElem>* pNode,TBinTreeNode0<TElem> **pe,TTraverseMode tm,
                        int startLevel, int endLevel)
{
long levelNo, hei;

TBinTreeNode<TElem> *rt;
rt =(TBinTreeNode<TElem> *) GetRoot();

if (startLevel<0 || endLevel<0)
hei = GetHeight(rt);
if (startLevel<0) startLevel = hei+startLevel+1;
if (endLevel<0) endLevel = hei+endLevel+1;

levelNo = GetLevel(pNode);
if (levelNo<=0) return 0;

startLevel = levelNo-endLevel+1;
endLevel = levelNo-startLevel+1;

return  ClusterDescendants(rt, pe, tm, startLevel, endLevel );

}

template <class TElem>
TBinTreeNode0<TElem> *TBinTree<TElem>:eleteSubTree(TBinTreeNode0<TElem>* pNode,char sonNo)
{
TBinTreeNode0<TElem> *p;
if (pNode==NULL) return NULL;
p = pNode->GetSon(sonNo);
pNode->SetSon(sonNo, NULL);
return p;
}

template <class TElem>
TBinTreeNode0<TElem> *TBinTree<TElem>:ocate(TBinTreeNode0<TElem>* pNode,TElem *e)
{
TBinTreeNode0<TElem> *p;
if (pNode==NULL) return  NULL;
if (pNode->GetElem()==*e) return pNode;
p =Locate(pNode->GetSon(1), e);
if (p!=NULL) return p;
return Locate(pNode->GetSon(2), e);
}

template <class TElem>
TBinTreeNode0<TElem> *TBinTree<TElem>img]images/smile/5.gif[/img]nPreToTree(TElem *pa, TElem *ia,
                  long p1, long p2, long i1, long i2)
{
long k;
TBinTreeNode<TElem> *p;

if (i1>i2) return NULL;

k=0;
while (pa[p1]!=ia[i1+k]) k++;

p= new TBinTreeNode<TElem>;
p->SetElem(&pa[p1]);
p->SetSon(1, InPreToTree(pa, ia, p1+1, p1+k, i1, i1+k-1) );
p->SetSon(2, InPreToTree(pa, ia, p1+k+1, p2, i1+k+1, i2) );

if (p->GetSon(1)!=NULL) p->GetSon(1)->SetFather(1,p);
if (p->GetSon(2)!=NULL) p->GetSon(2)->SetFather(2,p);

numNodes=p2-p1+1;
return p;

}

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);

p = new TBinTreeNode<TElem>;
if (p==NULL)
{
  delete [] s;
  throw TExcepComm(3);
}

top=0; i=1;
rt = p;
p->SetElem(&es[gListExp]);
s[++top] = p;
do
{
  i++;
  if (gListExp=='(') continue;
  if (gListExp==',' || gListExp==')') top--;
  else
  {
if (gListExp=='*') p = NULL;
else
{
p = new TBinTreeNode<TElem>;
if (p==NULL)
{
   delete [] s;
   throw TExcepComm(3);
}
p->SetElem(&es[gListExp]);
}

if (gListExp[i-1] == '(' )
{
s[top]->SetSon(1, p);
if (p!=NULL) p->SetFather(1, s[top]);
}
else
{
s[top]->SetSon(2, p);
if (p!=NULL) p->SetFather(2, s[top]);
}

s[++top] = p;

  }

} while (top!=0);

delete [] s;
return rt;

}

template <class TElem>
TBinTreeNode0<TElem> *TBinTree<TElem>:reOrderExToTree(TElem *nodes, int numElem)
{
int i, top;
TBinTreeNode<TElem> *p, *rt;
struct TPreOrderExToTreeStackRec
{ TBinTreeNode<TElem> *pNode;
      char tag;
};

TPreOrderExToTreeStackRec *sk;
if (nodes[0]==-1) return NULL;

sk = new TPreOrderExToTreeStackRec[numElem];
if (sk==NULL) throw TExcepComm(3);

rt = new TBinTreeNode<TElem>;
if (rt==NULL) goto ClearUp;

rt->SetElem(&nodes[0]);

top=0;
top++; sk[top].pNode=rt;
sk[top].tag=0;

i=1;
do
{
  if (nodes==-1)  p=NULL;
  else
  {
p = new TBinTreeNode<TElem>;
if (p==NULL) goto ClearUp;

p->SetElem(&nodes);
  }
  i++;

  if (!sk[top].tag)
{ sk[top].pNode->SetSon(1,p);
   sk[top].tag=1;
}
  else
{
   sk[top].pNode->SetSon(2,p);
   top--;
}
  if (p!=NULL)
  {top++; sk[top].pNode=p;
sk[top].tag=0;
  }

} while (top!=0);

return rt;

ClearUp:
delete [] sk;
throw TExcepComm(3);
}

template <class TElem>
TBinTreeNode0<TElem> *TBinTree<TElem>:reOrderExToTree(TElem *nodes)
{
TBinTreeNode<TElem> *rt;
static long start=0;

if (nodes[start]==-1)
{
start++;
return NULL;
}
rt = new TBinTreeNode<TElem>;
rt->SetElem(&nodes[start]);
start++;
rt->SetSon(1,PreOrderExToTree(nodes));
rt->SetSon(2,PreOrderExToTree(nodes));

return rt;
}

template <class TElem>
long TBinTree<TElem>::TreeToGList(TBinTreeNode0<TElem> *rt, TElem *e)
{
static long cnt=0;

if (rt==NULL) e[cnt++]='*';
else
{
  e[cnt++] = rt->GetElem();
  if (!rt->IsLeaf())
  {
e[cnt++] = '(';
TreeToGList(rt->GetSon(1), e);
e[cnt++] = ',';
TreeToGList(rt->GetSon(2), e);
e[cnt++] = ')';
  }
}
return cnt;
}

template <class TElem>
void TBinTree<TElem>:rint(TBinTreeNode0<TElem> *rt, char mode)
{
switch (mode)
{
  case 1:
if (rt==NULL) return ;
cout<<" "<<rt->GetElem();
Print(rt->GetSon(1),mode);
Print(rt->GetSon(2),mode);
break;
  case 2:
if (rt==NULL) return ;
Print(rt->GetSon(1),mode);
cout<<" "<<rt->GetElem();
Print(rt->GetSon(2),mode);
break;
  case 3:
if (rt==NULL) return ;
Print(rt->GetSon(1),mode);
Print(rt->GetSon(2),mode);
cout<<" "<<rt->GetElem();
break;

}
}

//////////////////Test//////////////////
main()
{
  int pa[]={1, 2, 4, 6, 3, 5, 7, 8};
  int ia[]={2, 6, 4, 1, 3, 7, 5, 8};
  TBinTree<int> t1;

  t1.SetRoot(t1.InPreToTree(pa, ia, 0, 7, 0, 7));
  cout<<"\n";
  t1.Print(t1.GetRoot(),1);

  cout<<"\n";
  t1.Print(t1.GetRoot(),2);

  cout<<"\nTotal number of nodes:"<<t1.GetNumSubNodes(t1.GetRoot());
  cout<<"\nTotal number of leaves:"<<t1.GetNumLeaves(t1.GetRoot());
  cout<<"\nHeight: "<<t1.GetHeight(t1.GetRoot());

  TBinTreeNode<int>* pNodes[10], *p;
  int n, i;
  int **es;

  es = new int*[10];

  n=t1.Cluster(t1.GetRoot(), es, PostOrder);
  cout<<"\n ClusterostOrder";
  for (i=0; i<n; i++)
  {
cout<<"  "<<*es;
  }

  n=t1.Cluster2(t1.GetRoot(), (TBinTreeNode0<int> **)pNodes, PreOrder);
  cout<<"\nPreOrder: ";
  for (i=0; i<n; i++)
  {
cout<<"  "<<pNodes->GetElem()<<":"<<t1.GetLevel(pNodes);
  }
  n=t1.Cluster2(t1.GetRoot(), (TBinTreeNode0<int> **)pNodes, InOrder);
  cout<<"\nInOrder:  ";
  for (i=0; i<n; i++)
  {
cout<<"  "<<pNodes->GetElem()<<":"<<t1.GetLevel(pNodes);
  }
  n=t1.Cluster2(t1.GetRoot(), (TBinTreeNode0<int> **)pNodes, PostOrder);
  cout<<"\nPostOrder:";
  for (i=0; i<n; i++)
  {
cout<<"  "<<pNodes->GetElem()<<":"<<t1.GetLevel(pNodes);
  }

  n=t1.ClusterDescendants(t1.GetRoot(), (TBinTreeNode0<int> **)pNodes,PreOrder,-2, -1);
  cout<<"\n Clusterevel PreOrder";
  for (i=0; i<n; i++)
  {
cout<<"  "<<pNodes->GetElem()<<":"<<t1.GetLevel(pNodes);
  }
  n=t1.ClusterDescendants(t1.GetRoot(), (TBinTreeNode0<int> **)pNodes,InOrder,-2, -1);
  cout<<"\n Clusterevel InOrder";
  for (i=0; i<n; i++)
  {
cout<<"  "<<pNodes->GetElem()<<":"<<t1.GetLevel(pNodes);
  }
  n=t1.ClusterDescendants(t1.GetRoot(), (TBinTreeNode0<int> **)pNodes,PostOrder,-2, -1);
  cout<<"\n Clusterevel PostOrder";
  for (i=0; i<n; i++)
  {
cout<<"  "<<pNodes->GetElem()<<":"<<t1.GetLevel(pNodes);
  }

  i=7;
  n=t1.ClusterAncestors(i, (TBinTreeNode0<int> **)pNodes);
  cout<<"\n Cluster:Ancestor:";
  for (i=0; i<n; i++)
  {
cout<<"  "<<pNodes->GetElem()<<":"<<t1.GetLevel(pNodes);
  }

  i=3;
  p=(TBinTreeNode<int> *)t1.Locate(t1.GetRoot(), &i);
  cout<<"\n"<<p->GetElem();

  n=t1.ClusterJuniors(p, (TBinTreeNode0<int> **)pNodes, PreOrder, 1, 2);
  cout<<"\n Cluster:Juniors:";
  for (i=0; i<n; i++)
  {
cout<<"  "<<pNodes->GetElem()<<":"<<t1.GetLevel(pNodes);
  }
  n=t1.ClusterSeniors(p, (TBinTreeNode0<int> **)pNodes, PreOrder, 1, 2);
  cout<<"\n Cluster:Seniors:";
  for (i=0; i<n; i++)
  {
cout<<"  "<<pNodes->GetElem()<<":"<<t1.GetLevel(pNodes);
  }

  TBinTree<int> t2, t3, t4;
  long listExp[]={'(', 1, '(', 2, '(', '*',',', 4, '(', 6, ',','*',')',')',',',
               3,'(','*',',',5,'(',7,',',8,')',')',')',')' };
  int es2[]={0,1,2,3,4,5,6,7,8};
  t2.SetRoot(t2.GListToTree(listExp, es2, 8));
  cout<<"\nGListToTree: ";
  t2.Print(t2.GetRoot(),1);

  int nodes[]={1,2,-1, 3, 5, -1, 6, -1, -1, -1, 4, -1, -1};
  t3.SetRoot(t3.PreOrderExToTree(nodes, 6));
  cout<<"\nPreOrderExToTree: ";
  t3.Print(t3.GetRoot(),1);
  cout<<"\n";
  t3.Print(t3.GetRoot(),2);

  t4.SetRoot(t4.PreOrderExToTree(nodes));
  cout<<"\nPreOrderExToTree2: ";
  t4.Print(t4.GetRoot(),1);
  cout<<"\n";
  t4.Print(t4.GetRoot(),2);

  n=t4.TreeToGList(t4.GetRoot(),nodes);
  cout<<"\n";
  for (i=0; i<n; i++)
  {
if (nodes>=0 && nodes<=9)
   printf(" %d", (char)nodes);
else printf(" %c", (char)nodes);
  }

  getchar();
}

//---------------------------------------------------------------------------

Solid · 发表于 2002-11-14 18:32:53

同学，数据结构的作业还是自己做吧

嘉定都市网

遍邀嘉网英豪，品快乐鸟啤酒虾

银翔湖夜景美如画

嘉定牙防所即将整体搬迁

紫藤公园全面进入盛花期

【福利】华叶小龙虾

快评：嘉福汇为何汇不住人气

紫藤公园绝美夜景图

新迎园DIY亲子活动

第一株紫藤已盛开

嘉定区村庄布局规划2014-2040

有人会编这个程序嘛？？有关二叉排序树的 [复制链接]

马上注册，结交更多好友，享用更多功能，让你轻松玩转社区。

浏览过的版块