You must implement and use your own binary tree class, and must implement at lea

Question

You must implement and use your own binary tree class, and must implement at least one of the methods operating on the expression tree recursively. For other data structures (e.g., stacks) you can use generic implementations provided by the java collection framework.

Program Input:
Your program should read fromthe standard input one line containing a fully parenthesized infix expression, with tokens (integers, operators, and parentheses) separated by spaces. You may assume that the expression is well-formed.

Program Output:
The program should print two lines (both terminated with newline characters). The first line should contain the expression in postfix expression, with the tokens separated by single spaces, and no leading or trailing spaces. The second line should contain a single integer, corresponding to the value to which the expression evaluates.

Sample Input:
( ( 1 + ( 2 * 3 ) ) + 4 )

Sample Output:
1 2 3 * + 4 + 11
This is a cse program... I am expecting coding for the answer
You must implement and use your own binary tree class, and must implement at least one of the methods operating on the expression tree recursively. For other data structures (e.g., stacks) you can use generic implementations provided by the java collection framework.

Program Input:
Your program should read fromthe standard input one line containing a fully parenthesized infix expression, with tokens (integers, operators, and parentheses) separated by spaces. You may assume that the expression is well-formed.

Program Output:
The program should print two lines (both terminated with newline characters). The first line should contain the expression in postfix expression, with the tokens separated by single spaces, and no leading or trailing spaces. The second line should contain a single integer, corresponding to the value to which the expression evaluates.

Sample Input:
( ( 1 + ( 2 * 3 ) ) + 4 )

Sample Output:
1 2 3 * + 4 + 11
This is a cse program... I am expecting coding for the answer
Your program should read fromthe standard input one line containing a fully parenthesized infix expression, with tokens (integers, operators, and parentheses) separated by spaces. You may assume that the expression is well-formed.

Program Output:
The program should print two lines (both terminated with newline characters). The first line should contain the expression in postfix expression, with the tokens separated by single spaces, and no leading or trailing spaces. The second line should contain a single integer, corresponding to the value to which the expression evaluates.

Sample Input:
( ( 1 + ( 2 * 3 ) ) + 4 )

Sample Output:
1 2 3 * + 4 + 11
This is a cse program... I am expecting coding for the answer
The program should print two lines (both terminated with newline characters). The first line should contain the expression in postfix expression, with the tokens separated by single spaces, and no leading or trailing spaces. The second line should contain a single integer, corresponding to the value to which the expression evaluates.

Sample Input:
( ( 1 + ( 2 * 3 ) ) + 4 )

Sample Output:
1 2 3 * + 4 + 11
This is a cse program... I am expecting coding for the answer
1 2 3 * + 4 + 11

Explanation / Answer

The code below shows how we may convert the infix to postfix expression after which we can evaluate the postfix expression.

Related Questions

Navigate

• Browse (All)
• Browse Y
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.