Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
I need help with a C function that takes as input an infix operation with unary operators and outputs the infix with binary operators only. Ex: 5/3++*2 = 5/4*2

I need help with a C function that takes as input an infix operation with unary operators and outputs the infix with binary operators only. Ex: 5/3++*2 = 5/4*2

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

I need help with a C function that takes as input an infix operation with unary operators and outputs the infix with binary operators only. Ex: 5/3++*2 = 5/4*2 

Specifications This project is meant to automate the conversion of "inorder/infix" expressions to the corresponding "PostOrder" and "PreOrder" expressions using "Expression Trees" Implementation In your implementation, your will use 'Stacks' in building your Expression trees Once built, the expression tree can be traversed in one of the three traversals we covered in class, i.e., LNR (in-order), LRN (post-order), NLR (pre-order). Input: The input to your program is an "Inorder Expression". The Inorder expression may contain both Unary and Binary Operators • For Unary operations, account for ++ and -- (without inter- spaces) As operands, and seeking simplicity, your expression will contain only single-digit integers (0-9) The Inorder expression may contain (multiple) spaces Output: You provide a Menu where the user can select: 1. Enter In-order Expression 2. "In-Order" / LNR Traversal 3. "Pre-Order" / NLR Traversal 4. "Post-Order" / LRN Traversal 5. Compute Expression 6. Quit The Menu is looped and the only way to exit the program is via "Quit"
Transcribed Image Text:Specifications This project is meant to automate the conversion of "inorder/infix" expressions to the corresponding "PostOrder" and "PreOrder" expressions using "Expression Trees" Implementation In your implementation, your will use 'Stacks' in building your Expression trees Once built, the expression tree can be traversed in one of the three traversals we covered in class, i.e., LNR (in-order), LRN (post-order), NLR (pre-order). Input: The input to your program is an "Inorder Expression". The Inorder expression may contain both Unary and Binary Operators • For Unary operations, account for ++ and -- (without inter- spaces) As operands, and seeking simplicity, your expression will contain only single-digit integers (0-9) The Inorder expression may contain (multiple) spaces Output: You provide a Menu where the user can select: 1. Enter In-order Expression 2. "In-Order" / LNR Traversal 3. "Pre-Order" / NLR Traversal 4. "Post-Order" / LRN Traversal 5. Compute Expression 6. Quit The Menu is looped and the only way to exit the program is via "Quit"
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS