bitree.cpp

二叉树的设计。包含二叉树结点类的设计以及二叉树的遍历。

// BiTree.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"

/***************************************************************************
 *   Copyright (C) 2007 by f   *
 *   [e-mail]   *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 *                                                                         *
 *   This program is distributed in the hope that it will be useful,       *
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
 *   GNU General Public License for more details.                          *
 *                                                                         *
 *   You should have received a copy of the GNU General Public License     *
 *   along with this program; if not, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.   
 *   writen by lijinhui 
                                        2007 11 10
 ***************************************************************************/


#ifdef HAVE_CONFIG_H
#include <config.h>
#endif

#include <iostream>
#include <cstdlib>

using namespace std;

#include "BiTree_class.h"

int main(int argc, char *argv[])
{
  cout << "Hello, world!" << endl;
  BiTree_class<int>  Tree;
 Tree.Set();
 cout<<endl<<"先序遍历："<<endl;
 Tree.PreOrderTree(Tree.Root());
 cout<<endl<<"中序遍历："<<endl;
 Tree.InOrderTree(Tree.Root( ));
 cout<<endl<<"后序遍历："<<endl;
 Tree.PostOrderTree(Tree.Root( ));
 cout<<endl;
 int n=Tree.Depth(Tree.Root( ) );
 cout<<"总深度为："<<n<<endl;
  return EXIT_SUCCESS;
}