习题6.2
来源：互联网 发布：淘宝联盟返利怎么算 编辑：程序博客网 时间：2024/05/22 03:45
///习题6.2 由二叉树得到中缀表达式，添括号int comp (char opt1,char opt2 ){if (opt1 == '*' || opt1 == '/'){if (opt2 == '*' || opt2 == '/' )return 0 ;else if (opt2 == '+' || opt2 == '-' ){return 1 ;} else return 2;}else{if (opt2 == '*' || opt2 == '/' )return 0 ;else if (opt2 == '+' || opt2 == '-' ){return 0;} else return 2;}}void print(BiTree T){if (T != null){if (T -> lchild == null && T -> rchild == null){cout<< T -> data ;}else{if (comp (T -> data , T -> lchild -> data) == 1){cout <<"(" ;}print (T -> lchild ) ;if (comp (T -> data , T -> lchild -> data) == 1){cout <<")" ;}cout << T -> data ;if (comp (T -> data , T -> rchild -> data) == 1){cout <<"(" ;}print (T -> rchild ) ;if (comp (T -> data , T -> rchild -> data) == 1){cout <<")" ;}}}}
