void inorder(int a[],int i,int n)
{
if(i>=n)
return;
inorder(a,2*i,n);
cout<<a[i]<<" ";
inorder(a,2*i+1,n);
}
void preorder(int a[],int i,int n)
{
if(i>=n)
return;
cout<<a[i]<<" ";
inorder(a,2*i,n);
inorder(a,2*i+1,n);
}
void afterorder(int a[],int i,int n)
{
if(i>=n)
return;
inorder(a,2*i,n);
inorder(a,2*i+1,n);
cout<<a[i]<<" ";
}
Heap traversal
Guess you like
Origin blog.csdn.net/m0_54621932/article/details/114192477
Recommended
Ranking