陳芃華 vivichen274

## reconstruction for general rooted tree(with input n and three sequences).cpp
#include<bits/stdc++.h>
using namespace std;

int n,root,TIB_Root_Node;

vector<int> dfs,dfs_minus,bfs;
vector<int> dfs_org,bfs_org,dfs_minus_org;
unordered_map<int,int> dfs_pos,bfs_pos;

vector<int> dfs_check,bfs_check,dfs_minus_check;

## Reconstruct one of the rooted trees(with input n and two sequences) .cpp
#include<bits/stdc++.h>
using namespace std;

int n;
vector<int> dfs,bfs;
map<int,int> dfs_pos,bfs_pos;
vector<set<int>> tree;

void build(int u,int l,int r){ // u 是節點數值，l~r 是 dfs 區間（索引）
    vector<int> children;
	#include<bits/stdc++.h>
	using namespace std;

	int n,root,TIB_Root_Node;

	vector<int> dfs,dfs_minus,bfs;
	vector<int> dfs_org,bfs_org,dfs_minus_org;
	unordered_map<int,int> dfs_pos,bfs_pos;

	vector<int> dfs_check,bfs_check,dfs_minus_check;
	#include<bits/stdc++.h>
	using namespace std;

	int n;
	vector<int> dfs,bfs;
	map<int,int> dfs_pos,bfs_pos;
	vector<set<int>> tree;

	void build(int u,int l,int r){ // u 是節點數值，l~r 是 dfs 區間（索引）
	vector<int> children;