binnodeptr1.h

用c实现的二叉树的中序遍历的读取与存储

#ifndef BINNODEPTR1_H
#define BINNODEPTR1_H
#include<iostream.h>
class BinNodePtr1
{
  private:
     int element;
     BinNodePtr1* lc;
     BinNodePtr1* rc;
  public:
     BinNodePtr1()
     {element=0;lc=rc=NULL;}
     BinNodePtr1(int e,BinNodePtr1* l=NULL,BinNodePtr1* r=NULL)
     {element=e;lc=l;rc=r;}
     int& val(){return element;}
     void setval(int& e){element=e;}
     BinNodePtr1* left(){return lc;}
     void setLeft(BinNodePtr1* b){lc=b;}
     BinNodePtr1* right(){return rc;}
     void setRight(BinNodePtr1* b){rc=b;}
     bool isLeaf(){return (lc==NULL)&&(rc==NULL);}
    // BinNodePtr1 left(){return *lc;}
    // BinNodePtr1 right(){return *rc;}
};
#endif