treenode1.h

C++编写的二叉树程序

#include <iostream.h>
class TreeNode1
{
public:
	char data;
	TreeNode1 *left,*right;
	TreeNode1(char ch='?');
	~TreeNode1(){}
	void preorderChild(TreeNode1 *p);
	void inorderChild(TreeNode1 *p);
	void postorderChild(TreeNode1 *p);
};
////////////////////////
TreeNode1::TreeNode1(char ch)
{
data=ch;
left=NULL;
right=NULL;
}
////////////////////////
void TreeNode1::preorderChild(TreeNode1 *p)
{
if(p!=NULL)
{
	cout<<p->data<<" ";
    preorderChild(p->left);
	preorderChild(p->right);
}
}
////////////////////////
void TreeNode1::inorderChild(TreeNode1 *p)
{
if(p!=NULL)
{
	
    preorderChild(p->left);
	cout<<p->data<<" ";
	preorderChild(p->right);
}
}
////////////////////////
void TreeNode1::postorderChild(TreeNode1 *p)
{
if(p!=NULL)
{
	
    preorderChild(p->left);
	preorderChild(p->right);
	cout<<p->data<<" ";
}
}