traverser.h

/***************************************************************************
 *   Copyright (C) 2004-2005 by Daniel Clarke                              *
 *   daniel.jc@gmail.com                                               *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 *                                                                         *
 *   This program is distributed in the hope that it will be useful,       *
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
 *   GNU General Public License for more details.                          *
 *                                                                         *
 *   You should have received a copy of the GNU General Public License     *
 *   along with this program; if not, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.             *
 ***************************************************************************/
#ifndef TRAVERSER_H
#define TRAVERSER_H

#include "btreenode.h"

class Traverser
{
public:
        Traverser(BTreeNode *root);
        ~Traverser();
        
        BTreeNode *start();
        
        BTreeNode *next();
        
        bool onLeftBranch();
        
        BTreeNode * oppositeNode();
        
        BTreeNode * current() const { return m_current; }

        void setCurrent(BTreeNode *current){m_current = current;}
        
        void descendLeftwardToTerminal();
        
        void moveToParent();
        
        BTreeNode *root() const {return m_root;}
        
protected:
        BTreeNode *m_root;
        BTreeNode *m_current;
};

#endif

---