递归算法对完全二叉树的前序遍历

# include<iostream>
# include<cstdio>
using namespace std;
int inorder(int i,int j)
{
    if(i<=j)
        printf("%d ",i);
    if(2*i<=j)
        inorder(2*i,j);
    if(2*i+1<=j)
        inorder(2*i+1,j);
    return 1;
}
int main()
{
    inorder(1,5);
}