소개글

자료구조

목차

없음

본문내용

typedef struct node *tree_pointer;
typedef struct node {
char data;
tree_pointer left_child,right_child;
}tree;

tree_pointer stack[MAX_STACK_SIZE];
int top=-1;

void preorder(tree_pointer);
void postorder(tree_pointer);
void add(int *,tree_pointer);
tree_pointer delete(int *);

int main(void)
{
tree_pointer no1,no2,no3,no4,ptr;

no1=(tree_pointer)malloc(sizeof(tree));
no2=(tree_pointer)malloc(sizeof(tree));