본문내용
#include
#include
#include
using namespace std ;
const int MAX = 100 ;
class TreeNode
{
public :
TreeNode() ;
char data ;
TreeNode *left ;
TreeNode *right ;
friend class Tree ;
friend class Nodestack ;
friend class Nodequeue ;
};
class Tree
{
public :
Tree() ;
TreeNode *head ;
TreeNode *tail ;
TreeNode *MakeTree(char *input) ;
void visit(TreeNode *traverse) ;
void preorder(TreeNode *traverse) ;
void inorder(TreeNode *traverse) ;
void postorder(TreeNode *traverse) ;
void levelorder(TreeNode *traverse) ;
void nonrecurpre(TreeNode *traverse) ;
void nonrecurin(TreeNode *traverse) ;
void nonrecurpost(TreeNode *traverse) ;
};
#include
#include
using namespace std ;
const int MAX = 100 ;
class TreeNode
{
public :
TreeNode() ;
char data ;
TreeNode *left ;
TreeNode *right ;
friend class Tree ;
friend class Nodestack ;
friend class Nodequeue ;
};
class Tree
{
public :
Tree() ;
TreeNode *head ;
TreeNode *tail ;
TreeNode *MakeTree(char *input) ;
void visit(TreeNode *traverse) ;
void preorder(TreeNode *traverse) ;
void inorder(TreeNode *traverse) ;
void postorder(TreeNode *traverse) ;
void levelorder(TreeNode *traverse) ;
void nonrecurpre(TreeNode *traverse) ;
void nonrecurin(TreeNode *traverse) ;
void nonrecurpost(TreeNode *traverse) ;
};
소개글