c语言数据结构逆波兰算法,[分享]表达式二叉树逆波兰式的转换程序源代码(C++)...

[分享]表达式二叉树逆波兰式的转换程序源代码(C++)

RT,这是我两年前学数据结构时的作品.

拿出来给大家分享.

ps:当时才学C++,代码写的不好,见笑了./*将中缀式转换为表达式树,并打印逆波兰式

**再将表达式树以中缀形式打印出来,并求值

**使用方法:编译运行后输入一个真确的表达式(比如 1+(2+4)*5)

**Version 2.0

**Write By Eastsun

**2005.4.18

*/

#include\"./stack.cpp\"

#include

#include

#define MAXSIZE 30

using namespace std;

//***************************************************

char match[]=\">><<<>>>><<<>>>>>><>>>>>><>><<<<<= >>>> >><<<<< =\";

char opera[]=\"+-*/()@\";

const char& Match(const char &ch1,const char &ch2)

{

int i=0,j=0;

while(opera[i]!=ch1) i++;

while(opera[j]!=ch2) j++;

return match[i*7+j];

}

//*****************************************************

class TNode

{

public:

TNode(string str=\"\",int b=0,TNode *l=NULL,TNode *r=NULL,TNode *p=NULL){

strcpy(id,str.c_str());

bit=b;

left=l;

right=r;

parent=p;

}

TNode(const char ch,TNode *l=NULL,TNode *r=NULL,TNode *p=NULL){

id[0]=ch;

id[1]=0;

bit=0;

left=l;

right=r;

parent=p;

}

const TNode& operator=(const TNode& tn){

strcpy(id,tn.id);

bit=tn.bit;

left=tn.left;

right=tn.right;

parent=tn.parent;

}

char id[MAXSIZE];

int bit;

TNode *parent,*left,*right;

};

int ReadExpr(char *str,char *expr,int start,int bit,int &length)

{

length=0;

if(str[start]==0){

expr[0]=0;

return 0;

}

else if(str[start]=='*'||str[start]=='/'||str[start]=='('||str[start]==')'||str[start]=='@'){

expr[0]=str[start];

expr[1]=0;

length=1;

return 2;

}

else if(bit||isdigit(str[start])||str[start]=='.'){ //read a digit string

int b=0;

int k=0; //index for expr

while(str[start]=='+'||str[start]=='-'){ //read sign

if(str[start]=='-') b++;

start++;

length++;

}

if(b%2) expr[k++]='-';

while(isdigit(str[start])||str[start]=='.'){

expr[k++]=str[start++];

length++;

}

expr[k]=0;

return 1;

}

else if(str[start]=='+'||str[start]=='-'){ //read a oper '+' or '-'

int b=0;

while(str[start]=='+'||str[start]=='-'){

if(str[start]=='-') b++;

start++;

length++;

}

if(b%2) expr[0]='-';

else expr[0]='+';

expr[1]=0;

return 2;

}

else return -1; //error

}

//

TNode *Translate(const string &str) //translate a expression string to a expression tree

{

char substr[MAXSIZE];

Stack cstk;

Stack tstk;

char *tempstr=new char[str.length()+2];

int start=0,bit=1;

int t,length;

strcpy(tempstr,str.c_str());

tempstr[str.length()]='@';

tempstr[str.length()+1]=0;

cstk.push('@');

t=ReadExpr(tempstr,substr,start,bit,length);

while(cstk.top()!='@'||substr[0]!='@'){

if(t==1){ //is a digit string

TNode *np=new TNode(substr,1);

tstk.push(np);

bit=0;

}

else if(t==2){ //is a oper

if(substr[0]=='(') bit=1;

else bit=0;

char tch=cstk.top();

if(Match(tch,substr[0])=='>'){

TNode *right=tstk.top();

tstk.pop();

TNode *left=tstk.top();

tstk.pop();

TNode *np=new TNode(tch,left,right);

left->parent=np;

right->parent=np;

tstk.push(np);

cstk.pop();

continue;

}

else if(Match(tch,substr[0])=='

else cstk.pop();

}

start+=length;

t=ReadExpr(tempstr,substr,start,bit,length);

}

delete[] tempstr;

return tstk.top();

}

//**********************打印逆波兰式**********

void print(TNode *root)

{

if(root->left){

print(root->left);

print(root->right);

cout<id;

}

else cout<id;

}

void prints(TNode*);

double solve(TNode*);

void printExpr(string str)

{

TNode *root=Translate(str);

cout<

print(root);

cout<

cout<

prints(root);

cout<

}

void prints(TNode *root) //将逆波兰式用中缀形式打印出来

{

if(root->left==NULL) cout<id; //is a leaf

else if(root->parent==NULL){

prints(root->left);

cout<id;

prints(root->right);

}

else if(root->parent->left==root&&Match(root->id[0],root->parent->id[0])=='>'){

prints(root->left);

cout<id;

prints(root->right);

}

else if(root->parent->right==root){

if(Match(root->parent->id[0],root->id[0])=='parent->id[0]=='+'){

prints(root->left);

cout<id;

prints(root->right);

}

else{

cout<

prints(root->left);

cout<id;

prints(root->right);

cout<

}

}

else{

cout<

prints(root->left);

cout<id;

prints(root->right);

cout<

}

}

double solve(TNode *root)

{

if(root->left==NULL){

istringstream in;

in.str(root->id);

double value;

in>>value;

return value;

}

else{

switch(root->id[0]){

case '+':

return solve(root->left)+solve(root->right);

case '-':

return solve(root->left)-solve(root->right);

case '*':

return solve(root->left)*solve(root->right);

case '/':

return solve(root->left)/solve(root->right);

}

}

}

//***********************************************

void Check(char *str) //判断为带符号且紧跟括号的情况,酌情在前面添\"0-\"

{

int k=0,i=0;

if(str[0]=='+'||str[0]=='-'){

int b=0;

while(str[k]=='+'||str[k]=='-'){

if(str[k]=='-') b++;

k++;

}

if(str[k]!='(') return;

char *np=new char[strlen(str)+3];

if(b%2){

np[0]='0';

np[1]='-';

memcpy(np+2,str+k,strlen(str)+1-k);

memcpy(str,np,strlen(np)+1);

}

else{

memcpy(np,str+k,strlen(str)+1-k);

memcpy(str,np,strlen(np)+1);

}

delete[] np;

}

}

//**********************main*********************

int main()

{

char buf[100];

while(1){

cin>>buf;

Check(buf);

printExpr(buf);

}

}