PAT A1020 Tree Traversals

题目 简单来说就是 知后序遍历和中序遍历求层次遍历 思路 先根据后序遍历和中序遍历建出二叉树 BFS求层次遍历 code # include <cstdio> # include <queue> # include <algorithm> # include <cstring> using namespace std; struct node{ int data; node* lc

>>阅读原文<<