一、树的静态写法
struct node{
typename data;
int child[maxn];
}Node[maxn];
struct node{
typename data;
vector child;
}Node[maxn];
二、树的先根遍历
void PreOrder(int root){
printf("%d ", Node[root].data);
for(int i = 0; i < Node[root].child.size(); i++){
PreOrder(Node[root].child[i]);
}
}
三、树的层序遍历
void LaryerOrder(int root){
queue<int> q;
q.push(root);
while(!q.empty()){
int front = q.front();
printf("%d ", Node[front].data);
q.pop();
for(int i = 0; i < Node[front].child.size(); i++){
q.push(Node[front].child[i]);//将当前结点的所有子结点入队
}
}
}
如果需要对结点进行求解,则需要在结构体出进行定义参数layer
void LaryerOrder(int root){
queue<int> q;
q.push(root);
while(!q.empty()){
int front = q.front();
printf("%d ", Node[front].data);
q.pop();
for(int i = 0; i < Node[front].child.size(); i++){
int child = Node[front].child[i];
Node[child].layer = Node[front].layer + 1;
q.push(Node[front].child[i]);//将当前结点的所有子结点入队
}
}
}