GitHub - HamdanSidz/Expression--Tree-all-in-depth-traversals-: It is easier to code expression trees when your infix expression is in postfix form.Using stack I build an expressioon tree, all three traversals pre, in , post orders are code in the file.

HamdanSidz / Expression--Tree-all-in-depth-traversals- Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

It is easier to code expression trees when your infix expression is in postfix form.Using stack I build an expressioon tree, all three traversals pre, in , post orders are code in the file.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
postfix_exptree_traverse.cpp		postfix_exptree_traverse.cpp

About

It is easier to code expression trees when your infix expression is in postfix form.Using stack I build an expressioon tree, all three traversals pre, in , post orders are code in the file.

cpp postfix data-structures prefix trees expression-tree infix