樹的遍歷

YES 題目：已知二叉樹中序、後序，求其層次遍歷node //已知中序、後序，求層次遍歷 #include <cstdio> #include <iostream> #include <string> #include <queue> using namespace std; //const int LEN = 105; typedef struct node{ char data;

>>阅读原文<<