FAQTs - Knowledge Base - View Entry - Algorithm: Expression: Postfix: Convert: How to convert a binary tree to a postfix expression? [RPN]

faqts : Computers : Programming : Algorithms

+ Search

Algorithm: animation: create: tools, Algorithm: animation: overview: Ciips, Algorithm: animation: overview: McGill, Algorithm: animation: overview: Duane Jarc,

Entry

Algorithm: Expression: Postfix: Convert: How to convert a binary tree to a postfix expression? [RPN]

Jan 4th, 2004 09:51
Knud van Eeden,

----------------------------------------------------------------------
--- Knud van Eeden --- 28 October 2003 - 06:10 pm --------------------

Algorithm: Expression: Postfix: Convert: How to convert a binary tree 
to a postfix expression? [RPN]

---

You can convert a binary tree to a postfix notation, by doing a 
postorder
traversal of that given binary tree.

---
---

Internet: see also:

---

Algorithm: Expression: Infix: Convert: Postfix: Overview: How convert 
infix to postfix expression?
http://www.faqts.com/knowledge_base/view.phtml/aid/26071/fid/585

----------------------------------------------------------------------