看似好像需要修改树,实则只需要动一动遍历的输出顺序就可以!
附本人AC代码:
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
struct Node {
int left, right, val;
};
vector<Node>V(10);
bool flag[10], fac;
void inorder(int a) {
if (V[a].right != -1)inorder(V[a].right);
if (!fac) {
fac = true;
printf("%d", V[a].val);
}
else printf(" %d", V[a].val);
if (V[a].left != -1)inorder(V[a].left);
}
int main() {
bool test = false;
int N, root;
char c1,c2;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
V[i].val = i;
cin.ignore();
scanf("%c %c", &c1, &c2);
if (c1 != '-') {
V[i].left = c1 - '0';
flag[c1 - '0'] = true;
}
else V[i].left = -1;
if (c2 != '-') {
V[i].right = c2 - '0';
flag[c2 - '0'] = true;
}
else V[i].right = -1;
}
for (int i = 0; i < 10; i++) {
if (flag[i] == false) {
root = i;
break;
}
}
queue<Node>Q;
Q.push(V[root]);
while (Q.size() != 0) { //bfs实现层序遍历
Node tmp = Q.front();
Q.pop();
if (!test) {
printf("%d", tmp.val);
test = true;
}
else printf(" %d", tmp.val);
if (tmp.right != -1)Q.push(V[tmp.right]);
if (tmp.left != -1)Q.push(V[tmp.left]);
}
printf("\n");
inorder(root);//递归实现右根左遍历
return 0;
}