Tag Archives for Infix Expression Evaluation
Infix and Postfix Expression Evaluation using Expression Tree
#include<stdio.h> struct NODE { char data; struct NODE *lchild; struct NODE *rchild; }; typedef struct NODE *node; node exptree( char[] ); void push_cha( … Continue reading