b_13_2.cpp

来自「C++应用教程原码,里面包含该书中有十三章内容的代码,详细具体」· C++ 代码 · 共 31 行

#include "stdafx.h"
#include <iostream>
#include<iomanip>
#include <string>
#include "tree.h"
using namespace std;

template <class Type>
void Tree <Type> :: leafCount(treeNode<Type> *&p,int& number)
{ 
  if (p != NULL)
  { 
    leafCount (p->Left(),number);
    leafCount (p->Right(),number);
	if (p->Left()==NULL && p->Right()==NULL)
		number++;
   }
}
char A[] = {'A','B','D','G','C','E','F'},B[] = {'D','G','B','A','E','C','F'};
void main()
{ Tree <char> a;
  int number =0;
  a.makeTree(0,6,0,6,a.root);
  cout << "该树的先序序列是："<<endl;
  a.traversalPreOrder(a.root);
  a.leafCount(a.root,number);
  cout << endl;
  cout << "该树的叶子的数量是："<<number<<endl;
  cin.get(); //等待结束，以便调测程序，可以删除
}