Expression Tree
Easy Accuracy: 55.88% Submissions: 24104 Points: 2

Given a full binary expression tree consisting of basic binary operators (+ , – ,*, /) and some integers, Your task is to evaluate the expression tree.

Example 1:

Input:
+
/     \
*       -
/  \    /   \
5    4  100  20

Output: 100

Explanation:
((5 * 4) + (100 - 20)) = 100

Example 2:

Input:
-
/   \
4     7

Output: -3

Explanation:
4 - 7 = -3

You dont need to read input or print anything. Complete the function evalTree() which takes root node as input parameter and returns an integer denoting the result obtained by simplifying the expression tree.

Expected Time Complexity: O(N)
Expected Auxiliary Space: O(height of tree)

Constraints:
1 ≤ N ≤ 500

We are replacing the old Disqus forum with the new Discussions section given below.