二叉树.cpp

输入结点和结点数生成二叉树

#include <iostream.h>
#include <stdlib.h>
#include "bltree.h"
//#include "treenode.h"

void main ()
{
    
   char data ;
   int n;
   BinSTree<char> tree;
   cout<<"请输入节点数：";
   cin>>n;
   for(int i=0;i<n;i++)
   {    cin>>data;
	   tree.Insert(data);

   } /* 建立二叉树         */
    TreeNode<char>   *root;    
    root=tree.GetRoot (); 
    cout<<"树的前序节点内容是："<<endl;
    tree.preorder (root);
    /* 后序遍历二叉树     */
	
    tree.Delete('b');
	cout<<"删除后的中序遍历是："<<endl;
	tree.inorder(root);
  

}