void leftin(Bintree* root)
{
    if(root&&root->left)
    {
        cout<<root->data<<" ";
        leftin(root->left);
    }
}

bool isleaf(Bintree* node)
{
    if(!node->left&&!node->right) return true;
    else return false;
}

void bottomin(Bintree* root)
{
    if(root)
    {
        if(isleaf(root)) cout<<root->data<<" ";
        else
        {
            bottomin(root->left);
            bottomin(root->right);
        }
    }
}

void rightin(Bintree* root)
{
    if(root&&root->right)
    {
        rightin(root->right);
        cout<<root->data<<" ";
    }
}

void printtree(Bintree* root)
{
    leftin(root);
    bottomin(root);
    rightin(root->right);
}