code[vs] 3143 二叉树的序遍历

/*
作者:桦清_L
*/
#include <iostream>
#include <cstring>
#include <map>
using namespace std;

int n;

struct node
{
int l;
int r;
}a[101];

void f_rec(int n,int s)
{
cout<<n;
if(s>0) cout<<" ";
if(a
.l) f_rec(a
.l,s-1);
if(a
.r) f_rec(a
.r,s-1);
}

void m_rec(int n,int s)
{
if(a
.l) m_rec(a
.l,s-1);
cout<<n;
if(s>0) cout<<" ";
if(a
.r) m_rec(a
.r,s-1);
}

void b_rec(int n,int s)
{
if(a
.l) b_rec(a
.l,s-1);
if(a
.r) b_rec(a
.r,s-1);
cout<<n;
if(s>0) cout<<" ";
}

int main()
{
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i].l>>a[i].r;
f_rec(1,n);
cout<<endl;
m_rec(1,n);
cout<<endl;
b_rec(1,n);
cout<<endl;
return 0;
}