1162 Postfix Expression

Brosto_Cloud

已于 2022-12-14 18:32:24 修改

阅读量380

点赞数

分类专栏： PAT甲级文章标签：算法 c++

于 2022-12-13 18:50:20 首次发布

本文链接：https://blog.csdn.net/weixin_53199925/article/details/128306351

版权

该博客介绍了如何将给定的二叉语法树转换为后缀表达式，同时考虑操作符的优先级，输出的后缀表达式中括号表示了运算的顺序。内容包括输入和输出规格，以及样例输入和输出。

摘要由CSDN通过智能技术生成

Given a syntax tree (binary), you are supposed to output the corresponding postfix expression, with parentheses reflecting the precedences of the operators.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤ 20) which is the total number of nodes in the syntax tree. Then N lines follow, each gives the information of a node (the i-th line corresponds to the i-th node) in the format:

data left_child right_child

where data is a string of no more than 10 characters, left_child and right_child are the indices of this node's left and right children, respectively. The nodes are indexed from 1 to N. The NULL link is represented by −1. The figures 1 and 2 correspond to the samples 1 and 2, respectively.