PAT A1020 Tree Traversals

題目 簡單來說就是 知後序遍歷和中序遍歷求層次遍歷 思路 先根據後序遍歷和中序遍歷建出二叉樹 BFS求層次遍歷 code # include <cstdio> # include <queue> # include <algorithm> # include <cstring> using namespace std; struct node{ int data; node* lc

>>阅读原文<<