tags:

views:

472

answers:

0
Q: 

How can we convert Prefix to Postfix expression ( without using expression tree)?

By using Stack data structure, we can easily convert "Infix to Postfix" and "infix to Prefix" but I can't convert Prefix to postfix.

yes, we can convert prefix to infix then infix to postfix. but I want direct conversion from prefix to postfix.

Is there any feasible solution (not expression tree) ?

related questions

How can I implement a stack?
General Question: Java has the heap and local stack. Can you access any object from the heap?
How do I extend infix and stack priorities to additional operators?
How can I increase the stack size with runhaskell?
Run-Time Check Failure #2 - Stack around the variable 'x' was corrupted.
Patching out CALLL by replacing with NOPs works in user space but not in kernel space
Fastest way to iterate over a stack in c#
How to detect possible / potential stack overflow problems in a c / c++ program?
Stack Size for Kernel Development
Stack memory read
How to determine optimal thread stack size?
Increase Stack Size on Windows (GCC)
OSI model - What's the presentation and session layer for?
How to preserve stack space with good design?
When does ++ not produce the same results as +1?
Stack overflow from .NET code in IIS, but not in Winforms
What is the best technology to build an online gambling / poker system ?
What and where are the stack and heap
Interpreting Stacks in Windows Minidumps
Hooking into the TCP Stack in C
Measuring stack usage for Linux multi-threaded app
Checking available stack size in C
Getting stack traces on Unix systems, automatically
How to prevent an object being created on the heap?
Of Memory Management, Heap Corruption, and C++