개발 공부하는 빙빙

oper = ['+','-','*','/'] def cal(node): #후위순회 global result if not tree[node][0] in oper: #부모노드가 숫자이면 return tree[node][0] else: #부모노드가 연산자이면 left = cal(tree[node][1]) right = cal(tree[node][2]) if tree[node][0] == '+': result = left + right elif tree[node][0] == '-': result = left - right elif tree[node][0] == '*': result = left * right elif tree[node][0] == '/': result = left // right return r..