C++实现二叉排序树的构造与操作

#ifndef __BICHTREE_H__
#define __BICHTREE_H__

#include<iostream>
using namespace  std;
//template<class element>
//........................................................................ 二叉树节点的定义...................................................
class BichaTreeNode{                                  //二叉树节点的定义
   private: 
    int  data;                       //数据
   public:   
   BichaTreeNode *left;                  //左节点
   BichaTreeNode *right;                  //右节点 
   //BichaTreeNode(){};
   BichaTreeNode(int myData){ data=myData; left=NULL;right=NULL;}         //二叉树节点的构造
   int getData()          {return data;}                                   //访问节点数据
   void insertNewNode(BichaTreeNode *newNode)                                  // 插入新的节点    
   {
      if(data<=newNode->getData())
  {
     if(this->right!=NULL)
  this->right->insertNewNode(newNode);
 else
 this->right=newNode;

  }
  else{
     if(this->left!=NULL)
  this->left->insertNewNode(newNode);
 else

 this->left=newNode;
  
  }
   }

            void traveral()             //二叉树的中序遍历
{
     if(this!=NULL)
 {
  this->left->traveral();
  cout<<this->getData()<<"\t";
  this->right-> traveral();
 
 }
 
 
}

void preTraveral()   //二叉树前序遍历
{
  if(this!=NULL)
  {
  cout<<this->getData()<<"\t";
  this->left->preTraveral();
  this->right->preTraveral();

  }
}

void   postTraveral()             //二叉树的后续遍历