binnode1.h

来自「这是用vc编写的二叉树排序算法 希望大家多给意见 是数据结构的一种算法」· C头文件 代码 · 共 56 行

// binnode1.h: interface for the binnode class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_BINNODE1_H__C41FBA5D_2A1F_4166_898F_4C2AD95B88C8__INCLUDED_)
#define AFX_BINNODE1_H__C41FBA5D_2A1F_4166_898F_4C2AD95B88C8__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
#include<iostream>
using namespace std;
class binnode  
{
public:

	
	binnode(int e){lc=rc=NULL;elem=e;}
	binnode(int element,binnode* leftchild,binnode* rightchild)
	{
		elem=element;
		lc=leftchild;
		rc=rightchild;
	}
	
	
	void buildtree(string in,int& i){
		if(in[i]==' '||i>=in.length())++i;
	    else{
		   lc=new binnode(in[i]);
		   lc->buildtree(in,++i);
		}
        if(in[i]==' '||i>=in.length()){++i;return;}
 	    else{
	    rc=new binnode(in[i]);
		rc->buildtree(in,++i);
		}
	}
	virtual ~binnode();
	int& val(){return elem;}
	void setval(const int& e){elem=e;}
	bool isleft(){return(lc==NULL)&&(rc==NULL);}
    binnode*& left(){return lc;}
	binnode*& right(){return rc;}
	void setleft(binnode* l){lc=l;}
	void setright(binnode* r){rc=r;}

private:
	int elem;
	binnode* lc;
	binnode* rc;

};

#endif // !defined(AFX_BINNODE1_H__C41FBA5D_2A1F_4166_898F_4C2AD95B88C8__INCLUDED_)