Hello my friend, Please add screenshot for code and output of all answer, screenshot should all screen view including date and time.And add java program name is Manmeet Singh Kahlon. It's all that my teacher required Thanks for your time

Create the node of the expression tree. Get the postfix expression (in the form of string) as input and construct the expression tree using Stack ADT. Perform the preorder, inorder and postorder traversals on the expression tree. The program should have the following options: . Get the postfix expression 2. Construct the expression tree 3. Preorder traversal and print it 4. Inorder traversal and print it 5. Postorder traversal and print it 6. Exit