二叉树遍历之递归算法

# include<iostream>
# include<cstdio>
using namespace std;

struct Node
{
    int data;
    Node *rchild,*lchild;
};
void visit(int x)
{
    printf("%d",x);
}

void Preorder(Node *T)
{
    if(T==NULL) return ;
    visit(T->data);
    Preorder(T->rchild);
    Preorder(T->lchild);
}

int main()
{
    return 0;
}