hello,
i am student and i want to know more abour binary expression tree...i hav idea about creating binary search tree ....bt v r suposed to create binary expression tree....e.g..for a+b....+
(infix/prefix/postfix) / \
a b
will u plz help me how to proceed??

hello,
i am student and i want to know more abour binary expression tree...i hav idea about creating binary search tree ....bt v r suposed to create binary expression tree....e.g..for a+b....+
(infix/prefix/postfix) / \
a b
will u plz help me how to proceed??

Check out this link .... Maybe this will help
http://www.google.com/search?hl=&q=binary+expression+tree&sourceid=navclient-ff&rlz=1B3GGGL_enIN258IN259&ie=UTF-8&aq=0&oq=binary+expression+

If you google properly you might even find out C++ code for it