二叉树的三种遍历方法

//二叉树的先序遍历
int lch[MAX_N],rch[MAX_N];
void preorder(int u)
{
	cout<<"visiting "<<u<<endl;
	if(lch[u])
	{
		preorder(lch[u]);
	}
	if(rch(u))
	{
		preorder(rch(u));
	}
 }
//二叉树的中序遍历
int lch[MAX_N], rch[MAX_N];
void preorder(int u) {
    if (lch[u]) {
        preorder(lch[u]);
    }
    cout << "visiting " << u << endl;
    if (rch[u]) {
        preorder(rch[u]);
    }
}
//二叉树的后序遍历
int lch[MAX_N], rch[MAX_N];
void preorder(int u) {
    if (lch[u]) {
        preorder(lch[u]);
    }
    if (rch[u]) {
        preorder(rch[u]);
    }
    cout << "visiting " << u << endl;
}