![](https://cos-cdn.shuashuati.com/pipixue-wap/2020-1230-1107-56/ti_inject-812ce.png)
根据树的双标记层次遍历序列,求其带度数的后根遍历序列Given the double-tagging level-order traversal sequence of a tree, please write down the post-order traversal sequence with degree.比如:已知一棵树的双标记层次遍历序列如下:For example, assume that a tree's double-tagging level-order traversal sequence is shown as followed:【图片】