二叉树的递归方式遍历
前序遍历
void preOrderRecur(Tree* tree)
{
if(tree==NULL) return ;
cout<<tree->data<<" ";
preOrderRecur(tree->lson);
preOrderRecur(tree->rson);
}void preOrderRecur(Tree* tr二叉树的递归方式遍历
void preOrderRecur(Tree* tree)
{
if(tree==NULL) return ;
cout<<tree->data<<" ";
preOrderRecur(tree->lson);
preOrderRecur(tree->rson);
}void preOrderRecur(Tree* tr