For the given code, what is the value of expression tree, if we use in-order traversal algorithm?
class Node: def __init__(self, data) : =data =None =None root = Node('+') = Node('') = Node(2) = Node(8) = Node('') = Node(3) = Node(2)
a. 16
b. 22
c. 60
d. 50