14545645

#include <iostream>
#include <unordered_map>
#include <vector>

using namespace std;

struct Node {
char value;
vector<Node*> children;

Node(char val) : value(val) {}
};

unordered_map<char, Node*> buildTree(const vector<pair<char, char>>& pairs) {
unordered_map<char, Node*> nodes;

for (const auto& pair : pairs) {
char parent = pair.first;
char child = pair.second;

if (nodes.find(parent) == nodes.end()) {
nodes[parent] = new Node(parent);
}

if (nodes.find(child) == nodes.end()) {
nodes[child] = new Node(child);
}

nodes[parent]->children.push_back(nodes[child]);
}

return nodes;
}
void preorderTraversal(Node* node, vector<char>& traversal) {
if (!node) {
return;
}
traversal.push_back(node->value);

for (Node* child : node->children) {
preorderTraversal(child, traversal);
}
}
void postorderTraversal(Node* node, vector<char>& traversal) {
if (!node) {
return;
}
for (Node* child : node->children) {
postorderTraversal(child, traversal);
}
traversal.push_back(node->value);
}
int main() {
vector<pair<char, char>> pairs;
char parent, child;
// 读取输入
while (cin >> parent >> child) {
pairs.push_back(make_pair(parent, child));
}
unordered_map<char, Node*> tree = buildTree(pairs);
vector<char> postorder;
postorderTraversal(tree['A'], postorder);
for (char val : postorder) {
cout << val << " ";
}
cout << endl;
return 0;
}