二叉树1 (猴子下山)

#include"iostream"
#include"queue"
#include"cmath"
using namespace std;
typedef int element;

static bool *change;            //记录结点开关
static int count1;                //记录猴子到达个数
class Tree{
private:
    element data;
    Tree *right;
    Tree *left;
public:

    Tree(){}
    Tree(element data){
        this->data = data;
        right = NULL;
        left = NULL;
    }
    void createSQTree(Tree* &t,int n){
        queue<Tree*> q;
        int i = 0;
        t = new Tree(++i);
        Tree *p = t;
        q.push(p);
        while(i != n){
            p = q.front();
            p->left = new Tree(++i);
            q.push(p->left);
            if(i == n){
                break;
            }
            p->right = new Tree(++i);
            q.push(p->right);
            q.pop();
        }
    }
    void destroy(){
        if(this){
            left->destroy();
            right->destroy();    
            delete this;
        }
    }
    void showx(Tree* t,int momkey){
        if(t){
            if(t->left == NULL && t->right == NULL && count1 == momkey - 1){
                cout<<t->data<<endl;
                return ;
            }
            if(change[t->data]){
                change[t->data] = false;
                showx(t->left,momkey);
            }
            else{
                change[t->data] =true;
                showx(t->right,momkey);
            }
        }
        else{
            if(++count1 == momkey){
                return ;
            }
            showx(this,momkey);
        }
    }
};

int main(){
    Tree *t = NULL;
    while(true){
        int d;                //深度
        int momkey;            //猴子个数
        cin>>d>>momkey;
        if(d==0&&momkey==0){
            break;
        }
        count1 = 0;
        int num = pow(2,d) - 1;    //结点个数
        change = new bool[num + 1];
        for(int i = 0;i < num;i++){
            change[i] = true;
        }    
        t->createSQTree(t, num);
        t->showx(t,momkey);
        t->destroy();
        delete[] change;
    }
    return 0;
}