I have a Binary tree for a mathematical expression(infix), i want to convert directly this TREE to a postfix(Stack) can any body suggest the algorithm?
Algorithm for converting Binary tree to postfix mathematical expression?

Best Answer
What youâ€™re searching for is known as postorder tree traversal:

Other Answer1
Easy, each node is (Left, Right, Data). Start with the first node. execute the algorithm for the left subtree if available and then execute the algorithm for the right subtree and then print the data.
For example:
Produces: 2 3 * 4 5  + 

comments:

Relate
 Converting rose trees to different binary tree types
 Converting List to Binary Search Tree, and the opposite
 Converting mathematical formula into an programmatic algorithm
 Converting R formula format to mathematical equation
 Converting a decimal number into binary
 Converting int and float to binary
 Converting hexadecimal string to binary
 MATLAB: Parsing text from a file, and converting to a mathematical set
 converting grammar (written in ANTLR) of a language into formal language/mathematical notations
 Right Threading a Binary Tree
 Shortest branch in a binary tree?
 Binary Tree Isomorphism
 Binary Tree's usage
 Binary Tree Height
 Balanced Binary Tree
comments: