硬核孑孓

#include<bits/stdc++.h>
using namespace std;
struct node{
int value,left,right;
}tree[110];
void binarytree1(int n){
cout<<tree[n].value<<" ";
if(tree[n].left!=0) binarytree1(tree[n].left);
if(tree[n].right!=0) binarytree1(tree[n].right);
}
void binarytree2(int n){
if(tree[n].left!=0) binarytree2(tree[n].left);
cout<<tree[n].value<<" ";
if(tree[n].right!=0) binarytree2(tree[n].right);
}
void binarytree3(int n){
if(tree[n].left!=0) binarytree3(tree[n].left);
if(tree[n].right!=0) binarytree3(tree[n].right);
cout<<tree[n].value<<" ";
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>tree[i].value>>tree[i].left>>tree[i].right;
}
binarytree1(1);
cout<<endl;
binarytree2(1);
cout<<endl;
binarytree3(1);
cout<<endl;
return 0;
}