/* Declarations for a typical tree-node class
 * Common operations
 *   For any binary tree:
 *
 * For a binary search tree, an operator must be available to determine
 * when one node comes before another.  
 * as well as an equal method.  This node therefore uses the Entry class 
 * for data storage.
 */
#ifndef _TREENODE_H
#define _TREENODE_H

#include <string>
using namespace std;

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
 * * * * * * * * * * * * * * * * * Class Header * *  * * * * * * * * * * * * * * *  
 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
 */

template <class T>
class TreeNode {

  protected:
    T data;      // the information to be stored in the node
    TreeNode<T> * left;   // the pointer to the node's left subtree
    TreeNode<T> * right;  // the pointer to the node's right subtree

  public:
    // Constructors
    TreeNode (T startingData) ;

    TreeNode  (T * initData, TreeNode <T> * leftNode, TreeNode <T> * rightNode) ;

    // extractors
    T * getData ();

    TreeNode <T> * getLeft () ;

    TreeNode <T> * getRight () ;

    // modifiers
    void setData (T newData) ;

    void setLeft (TreeNode<T> * newLeft) ;
    
    void setRight (TreeNode<T> * newRight) ;
    
} ;

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
 * * * * * * * * * * * * * * *  Implementation Code  * * * * * * * * * * * * * * *  
 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
 * Since TreeNode is a templated class, implementation details normally must be
 * included in the header file, because the compiler must create code for 
 * instantiated class required in an application.  This is not possible, if 
 * the templated class is implamented and compiled in a separate file.
 * For additional information, see https://cplusplus.com/forum/general/12575/ 
 */

// Constructors
template <class T>
TreeNode<T>::TreeNode (T startingData) :
   data (startingData),
   left (NULL),
   right (NULL)
   {
}

template <class T>
TreeNode<T>::TreeNode  (T * initData, TreeNode <T> * leftNode, TreeNode <T> * rightNode) :
    data (*initData),
    left (leftNode),
    right (rightNode)
    {
}

// extractors
template <class T>
T * TreeNode<T>::getData () {
    return & data;
}

template <class T>
TreeNode <T> * TreeNode<T>::getLeft () {
    return left;
    }

template <class T>
TreeNode <T> * TreeNode<T>::getRight () {
    return right;
}

// modifiers
template <class T>
void TreeNode<T>::setData (T newData) {
    data = newData;
}

template <class T>
void TreeNode<T>::setLeft (TreeNode<T> * newLeft) {
    left = newLeft;
}

template <class T>
void TreeNode<T>::setRight (TreeNode<T> * newRight) {
    right = newRight;
}

// end TreeNode implementation











#endif