Bintree.h

Go to the documentation of this file.

//
//  Created by Matthias Thöny on 1/11/12.
//  Copyright (c) 2012 University of Zuerich. All rights reserved.
//
#ifndef VMML_Bintree_h
#define VMML_Bintree_h

#include "BintreeNode.h"

namespace geData {
    template <class T>
    class Bintree
    {
    protected:
        BintreeNode<T> * root;
        
    public:
        //constructors and destructor
        Bintree() {}
        Bintree(T _data): root(new BintreeNode<T>(_data)){}
        virtual ~Bintree() {
            if(this->root != NULL)
            {
                delete this->root;
            }
        }
        
        //insert in a heap structure
        bool insert(T data)
        {
            if(this->root == 0L)
            {
                this->root = new BintreeNode<T>(data);
                this->root->setData(data);
                return true;
                
            }else{
                return this->root->insert(data);
            }
        }
        
        bool remove(T _data){
            std::cout << "TODO" << std::endl;
            return false;
        }
        
        void printInorder() {
            if(this->root != 0L)
            {
                this->root->printInorder();
            }
            std::cout << std::endl;
        }
        
        void printPostorder() {
            if(root != 0L)
            {
                root->printPostorder();
            }
        }
        
        void printEuler() {
            if(root != 0L)
            {
                root->Euler();
            }
        }
    };
}
#endif