TreeNode.h

#ifndef _TREENODE_H
#define _TREENODE_H

#include "DBentry.h"

class TreeNode {
private:
    DBentry* entryPtr;
    TreeNode* left;
    TreeNode* right;

public:
    // A useful constructor
    TreeNode(DBentry* _entryPtr);

    // the destructor
    ~TreeNode();

    // sets the left child of the TreeNode.
    void setLeft(TreeNode* newLeft);

    // sets the right child of the TreeNode
    void setRight(TreeNode* newRight);

    // gets the left child of the TreeNode.
    TreeNode* getLeft() const;

    // gets the right child of the TreeNode
    TreeNode* getRight() const;

    // returns a pointer to the DBentry the TreeNode contains. 
    DBentry* getEntry() const;
    
    bool insert(DBentry* newEntry);
    
    DBentry* find(string name, int& probes);
    
    //parent and dir are to replace one parent pointer (right or left)
    bool remove(string name, TreeNode* parent, int dir);
    
    //Sets the parent to the maximum value of the calling tree
    void max(TreeNode* parent);
    
    //Counts active nodes in tree
    int countActive();
    
    void print();
};

#endif