(tree)
| 76 | |
| 77 | # 因为中序遍历会丢失括号信息, 因此尝试构造一个函数回复解析表达式 |
| 78 | def printexp(tree): |
| 79 | sVal = '' |
| 80 | if tree: |
| 81 | sVal = '(' + printexp(tree.getLeftChild()) |
| 82 | sVal = sVal + str(tree.getRootVal()) |
| 83 | sVal = sVal + printexp(tree.getRightChild()) + ')' |
| 84 | return sVal |
| 85 | |
| 86 | |
| 87 | pt = buildParseTree("( ( 10 + 5 ) * 3 )") |
no test coverage detected