Write pseudocode for a recursive method that evaluates a binary expression tree.

1
Write pseudocode for a recursive method that
evaluates a binary expression tree.
private int evalTree(curr) //assumes operands
are strings if isLeaf(curr) return
Integer.parseInt(curr.data) else switch
curr.data case '' return evalTree(curr.left)
evalTree(curr.left) break case
'/' return evalTree(curr.left) /
evalTree(curr.left) break case ''
return evalTree(curr.left) evalTree(curr.left)
break case '-' return
evalTree(curr.left) - evalTree(curr.left)
break