GLIBTree.h

Go to the documentation of this file.

#ifndef MMANN_GLIBTREE_H
#define MMANN_GLIBTREE_H


#include <iostream.h>
#include "RedBlackTree.h"
#include "GLIBNode.h"

template <class Data, class ConfigData>
class GLIBTree : public AGenericTree<Data, ConfigData>
{
public:
    GLIBTree(ACompareNodesAlgorithm<Data, ConfigData>* Compare, DeleteTreeDataEnum DeleteTreeData = NO_DELETE_TREE_ITEM,
                    ConfigData* pConfigData = NULL);

    virtual ~GLIBTree();

    virtual Data* Search(Data* NodeData, bool* NodeInserted);

    virtual Data* Find(Data* NodeData);

    Data* Delete(Data* NodeData);

    void Insert(Data* NodeData);

    int GetHeight();

    int GetNumberOfNodes();

private:
    GLIBTreeNode<Data, ConfigData> *m_Root;
};

template <class Data, class ConfigData>
GLIBTree<Data, ConfigData>::GLIBTree(ACompareNodesAlgorithm<Data, ConfigData>* Compare, DeleteTreeDataEnum DeleteTreeData,
                    ConfigData* pConfigData) : AGenericTree<Data, ConfigData>(Compare, DeleteTreeData, pConfigData)
{
    m_Root = NULL;
}

template <class Data, class ConfigData>
GLIBTree<Data, ConfigData>::~GLIBTree()
{
    if (m_Root != NULL)
        GLIBTreeNode<Data, ConfigData>::DeleteAllGLIBTreeNodes(m_Root, m_DeleteTreeData);
}

//Insert
template <class Data, class ConfigData>
void GLIBTree<Data, ConfigData>::Insert(Data* NodeData)
{
    bool Inserted = false;

    m_Root = GLIBTreeNode<Data, ConfigData>::Insert(m_Root, m_CompareNodes, NodeData, &Inserted);
}

//Remove
template <class Data, class ConfigData>
Data* GLIBTree<Data, ConfigData>::Delete(Data* NodeData)
{
    m_Root = GLIBTreeNode<Data, ConfigData>::Remove(m_Root, m_CompareNodes, NodeData);
    return NodeData;
}

//Find
template <class Data, class ConfigData>
Data* GLIBTree<Data, ConfigData>::Find(Data* NodeData)
{
    return GLIBTreeNode<Data, ConfigData>::Lookup(m_Root, m_CompareNodes, NodeData);
}

template <class Data, class ConfigData>
Data* GLIBTree<Data, ConfigData>::Search(Data* NodeData, bool* NodeInserted)
{
    *NodeInserted = false;
    if (m_Root != NULL)
    {
        Data *Temp = GLIBTreeNode<Data, ConfigData>::Search(m_Root, m_CompareNodes, NodeData);
        if (Temp == NULL)
        {
            *NodeInserted = true;
            Insert(NodeData);
        }

        return Temp;
    }

    *NodeInserted = true;
    Insert(NodeData);
    return NULL;
}

template <class Data, class ConfigData>
int GLIBTree<Data, ConfigData>::GetHeight()
{
    if (m_Root != NULL)
        return GLIBTreeNode<Data, ConfigData>::GetHeight(m_Root);
    else
        return 0;
}

template <class Data, class ConfigData>
int GLIBTree<Data, ConfigData>::GetNumberOfNodes()
{
    if (m_Root != NULL)
        return GLIBTreeNode<Data, ConfigData>::GetNodeCount(m_Root);
    else
        return 0;
}

#endif

---