수다닷컴

#include stdio.h
#include stdlib.h
typedef enum {Plus,Data} NodeKind;
typedef struct node {
NodeKind nodekind;
int data;
struct node *leftTree;
struct node *rightTree;
} TreeNode;
int eval();
main () {
int val;
// construct a sample tree : (1 + 2) + 3
TreeNode *tree1, *tree2, *tree3;
TreeNode *tree4, *tree5; // nodes for Plus (+)
tree1 = (TreeNode *) malloc (sizeof(TreeNode));
tree2 = (TreeNode *) malloc (sizeof(TreeNode));
tree3 = (TreeNode *) malloc (sizeof(TreeNode));
tree4 = (TreeNode *) malloc (sizeof(TreeNode));
tree5 = (TreeNode *) malloc (sizeof(TreeNode));
tree1-nodekind = Plus;
tree1-leftTree = tree2;
tree1-rightTree = tree5;
tree2-nodekind = Plus;
tree2-leftTree = tree3;
tree2-rightTree = tree4;
tree3-nodekind = Data;
tree3-data = 1;
tree3-leftTree = NULL;
tree3-rightTree = NULL;
tree4-nodekind = Data;
tree4-data = 2;
tree4-leftTree = NULL;
tree4-rightTree = NULL;
tree5-nodekind = Data;
tree5-data = 3;
tree5-leftTree = NULL;
tree5-rightTree = NULL;
// Print a AST by preorder traversing
printf(Preorder-traversing an AST: );
preOrderTrav(tree1); printf (\n);
// Evaluation of a AST
val = eval(tree1);
printf(The result of evaluation: %d \n, val);
}
int eval(TreeNode *t) {
if (t-nodekind == Data) return t-data;
else return (eval(t-leftTree) + eval (t-rightTree));
}
preOrderTrav (TreeNode *t) {
if (t-nodekind == Data) { printf(%d , t-data); return; }
if (t-nodekind == Plus) {
printf((+) );
preOrderTrav(t-leftTree);
preOrderTrav(t-rightTree);
return;
}
}

위의 트리 구조에서요 오퍼레이터 *를 추가한AST를 고려하여

Preorder-traversing an AST: (*) (+) 1 2 3
The result of evaluation: 9
이렇게 출력으 해야되요ㅠ 도와주세요 ㅠ
eval 함수 코드의 양이 3~6줄이고 preOrderTrav함수 코드의 양 10~15줄 이밖에 간련 부분을 수정할것.

신청하기