#include
#define MAX 100;
*p==AB+CD-*E/FG*+
tydef struct_node
{
int key;
struct _node *left;
struct _node *right;
}
node *head, *tail;
node *push(node *t)
{
if (top>= MAX-1)
{
printf("\n stack overflow.");
return NULL;
}
stack[++top] = t;
return t;
}
node *pop(void)
{
if(top
{
printf("\n stack under flow");
return NULL;
}
node* make_parse_tree(char *p) //이부분 설명 나무그림..
