-
Notifications
You must be signed in to change notification settings - Fork 0
/
evaluator.py
47 lines (43 loc) · 1.47 KB
/
evaluator.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
import math
class Evaluator:
def __init__(self, root):
self.root = root
self.ans = self.eval(root)
self.traversal = []
self.inorder(root)
def eval(self, node):
if not node:
return None
if node.type == "NUM":
return node.value
elif node.type == "NEG":
return -1 * self.eval(node.down)
elif node.type == "SIN":
return math.sin(self.eval(node.down))
elif node.type == "COS":
return math.cos(self.eval(node.down))
elif node.type == "TAN":
return math.tan(self.eval(node.down))
elif node.type == "EXP":
return self.eval(node.left) ** self.eval(node.right)
elif node.type == "MUL":
return self.eval(node.left) * self.eval(node.right)
elif node.type == "DIV":
return self.eval(node.left) / self.eval(node.right)
elif node.type == "ADD":
return self.eval(node.left) + self.eval(node.right)
elif node.type == "SUB":
return self.eval(node.left) - self.eval(node.right)
def inorder(self, node):
if not node:
return
if node.left:
self.inorder(node.left)
if node.down:
self.inorder(node.down)
if node.value:
self.traversal.append(node.value)
else:
self.traversal.append(str(node.type))
if node.right:
self.inorder(node.right)