Anderson tree problem

我想用Anderson树来做一些事情。因此，我开始将Julienne Walker版本移植到C++：http://www.eternallyconfuzzled.com/tuts/datastructures/jsw_tut_andersson.aspx

现在我有插入工作。但问题是，如果我使用优化编译，它会崩溃。甚至-O1也崩溃了。

template <class Tv>
class AaTree
{
private:
    template <typename Tdata>
    struct AaNode
    {
        AaNode()
        {
            level = 0;
            link[0] = 0L;
            link[1] = 0L;
        }
        ~AaNode()
        {}

        int level;
        Tdata data;
        AaNode<Tdata>* link[2];
    };

    AaNode<Tv>* root;
    AaNode<Tv>* nil;  // sentinel
    inline AaNode<Tv>* make_node(Tv data, int level)
    {
        AaNode<Tv>* rn = new AaNode<Tv>();
        rn->data = data;
        rn->level = level;
        rn->link[0] = rn->link[1] = nil;
    }
    inline AaNode<Tv>* skew(AaNode<Tv>* t)
    {
        if (t->link[0]->level == t->level && t->level != 0)
        {
            AaNode<Tv>* save = t->link[0];
            t->link[0] = save->link[1];
            save->link[1] = t;
            t = save;
        }
        return t;
    }

    inline AaNode<Tv>* split(AaNode<Tv>* t)
    {
        if (t->link[1]->link[1]->level == t->level && t->level != 0)
        {
            AaNode<Tv>*save = t->link[1];
            t->link[1] = save->link[0];
            save->link[0] = t;
            t = save;
            ++t->level;
        }
        return t;
    }

    AaNode<Tv>* _insert(AaNode<Tv>* root, Tv data)
    {
        if (root == nil)
            root = make_node(data, 1);
        else {
            AaNode<Tv>* it = root;
            AaNode<Tv>* path[64];
            int top=0, dir=0;
            for (;;) 
            {
                path[top++] = it;
                dir = it->data < data;
                if (it->link[dir] == nil)
                    break;
                it = it->link[dir];
            }
            it->link[dir] = make_node(data, 1);
            while (--top >= 0) 
            {
                if (top != 0)
                    dir = path[top - 1]->link[1] == path[top];
                path[top] = skew(path[top]);
                path[top] = split(path[top]);
                    if ( top != 0 )
                    path[top - 1]->link[dir] = path[top];
                else
                    root = path[top];
            }
        }
        return root;
    }       
    void _print(AaNode<Tv>* root)
    {
        if (root != nil)
        {
            _print(root->link[0]);
            printf("level(%d): %dn", root->level, root->data);
            _print(root->link[1]);
        }
    }

public:
    AaTree()
        : root(0L)
    {
        nil = new AaNode<Tv>();
        root = nil;
    }
    ~AaTree()
    {}
    void Insert(Tv data)
    {
        root = _insert(root, data);
    }
    void Delete(Tv data)
    {
        root = _remove(root, data);
    }
    void Print()
    {
        _print(root);
    }   
};

int main(int argc, char* argv[])
{
    AaTree<int> tree;
    for (int i = 0; i < 100; i++)
        tree.Insert(i);
    tree.Print();
    return 0;
}