遍历二叉树（关键在于顺序）

 传送门P1305 新二叉树 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

#include <iostream>

using namespace std;

struct node
{
    char f, l, r;
}tree[1010]; //可以这样定义树的节点
char root;
int n;

void dfs(char u) //递归搜索树
{
    if(u == '*') return; //剪枝
    
    printf("%c", u);
    
    dfs(tree[u].l);
    
    dfs(tree[u].r);
}
int main()
{
    cin >> n;
    
    for(int i = 1; i <= n; i ++ )
    {
        char t;
        cin >> t;
        
        if(i == 1) root = t; //记一下根节点
        
        cin >> tree[t].l >> tree[t].r;
    }
    
    //前序遍历(根左右)
    dfs(root);
    return 0;
}

前序遍历

#include <iostream>
#include <vector>
using namespace std;

struct node
{
    char f, l, r;
}tree[1010]; //可以这样定义树的节点
char root;
int n;


void dfs(char u, vector<char> &vec) //递归搜索树
{
    if(u == '*') return; //剪枝
    
    vec.push_back(u);
    dfs(tree[u].l, vec);
    
    dfs(tree[u].r, vec);
    
}
int main()
{
    vector<char> vec;
    cin >> n;
    
    for(int i = 1; i <= n; i ++ )
    {
        char t;
        cin >> t;
        
        if(i == 1) root = t; //记一下根节点
        
        cin >> tree[t].l >> tree[t].r;
    }
    
    //前序遍历(根左右)
    dfs(root, vec);
    
    for(int i = 0; i <= vec.size(); i ++ )
    {
        cout << vec[i];
    }
    return 0;
}

 中序遍历

#include <iostream>
#include <vector>
using namespace std;

struct node
{
    char f, l, r;
}tree[1010]; //可以这样定义树的节点
char root;
int n;


void dfs(char u, vector<char> &vec) //递归搜索树
{
    if(u == '*') return; //剪枝
    
    dfs(tree[u].l, vec);
    vec.push_back(u);
    dfs(tree[u].r, vec);
    
}
int main()
{
    vector<char> vec;
    cin >> n;
    
    for(int i = 1; i <= n; i ++ )
    {
        char t;
        cin >> t;
        
        if(i == 1) root = t; //记一下根节点
        
        cin >> tree[t].l >> tree[t].r;
    }
    
    //前序遍历(根左右)
    dfs(root, vec);
    
    for(int i = 0; i <= vec.size(); i ++ )
    {
        cout << vec[i];
    }
    return 0;
}

 后序遍历

#include <iostream>
#include <vector>
using namespace std;

struct node
{
    char f, l, r;
}tree[1010]; //可以这样定义树的节点
char root;
int n;


void dfs(char u, vector<char> &vec) //递归搜索树
{
    if(u == '*') return; //剪枝
    
    dfs(tree[u].l, vec);
    
    dfs(tree[u].r, vec);
    vec.push_back(u);
}
int main()
{
    vector<char> vec;
    cin >> n;
    
    for(int i = 1; i <= n; i ++ )
    {
        char t;
        cin >> t;
        
        if(i == 1) root = t; //记一下根节点
        
        cin >> tree[t].l >> tree[t].r;
    }
    
    //前序遍历(根左右)
    dfs(root, vec);
    
    for(int i = 0; i <= vec.size(); i ++ )
    {
        cout << vec[i];
    }
    return 0;
}

string建树：

#include <iostream>
#include <cstring>
#include <string>
using namespace std;

int n;
string s;

int main()
{
    cin >> n;
    
    cin >> s;
    
    for(int i = 2; i <= n; i ++ )
    {
        string tmp;
        cin >> tmp;
        
        int x = s.find(tmp[0]);//找到子树根节点坐标
        s.erase(x, 1);//在原树中删掉子树父节点，x为坐标1长度
        s.insert(x, tmp); //将tmp插在x处
    }
     //前序遍历
    for(int i = 0; i < s.size(); i ++ )
    {
        if(s[i] != '*') cout << s[i];
    }
    
    return 0;
}