Java need help My problem is how to print out the binary infix expression tree?

Question

Java need help

My problem is how to print out the binary infix expression tree?

Create an implementation of a binary tree using the recursive approach. In this approach, each node is a binary tree. Thus a binary tree contains a reference to the element stored at its root as well as references to its left and right subtrees. You may also want to include a reference to its parent. Please use java. I'm very confused as to what this question is asking for, and I would like to see a working code. Please help... Test/demonstrate your binary tree by doing the following: Request file name from user, Read an infix expression from file, Build binary expression tree, Display binary expression tree, Evaluate binary expression tree, Display result. ----------------------------------------------------------------------------- expressions.txt: (9 + 4) * 5 + (4 - (6 + 3)) # This is a comment # Note first expression should evaluate to 60 42 + ( 10 - 2 ) + ( 5 * 3 ) / 6 # Note second expression should evaluate to 65 / 6 or 10 (integer division)

Explanation / Answer

________________________________________

________________________________________________________

Related Questions

Navigate

• Browse (All)
• Browse J
• Subjects

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