Search  

---

C:/temp/src/j2k/DataType/BST/BinNode.cpp

Go to the documentation of this file.

// BinNode.cpp - Binary Search Tree Node Class Implementation
#include <j2k/DataType/BST/BinNode.hpp>

// This creates space for the freelist variable
BinNode* BinNode::freelist = NULL;

// Two constructors -- with and without initial values
inline BinNode::BinNode() 
: element ( NULL ),
  left    ( NULL ),
  right   ( NULL ) { }


inline BinNode::BinNode( DBase* e ) 
: element ( e    ),
  left    ( NULL ),
  right   ( NULL ) { }

inline BinNode::BinNode( DBase* e, BinNode* l ) 
: element ( e    ),
  left    ( l    ),
  right   ( NULL ) { }


inline BinNode::BinNode( DBase* e, BinNode* l, BinNode* r ) 
: element ( e ), 
  left    ( l ),  
  right   ( r ) { }

BinNode::~BinNode() { }

int BinNode::CompareID( String& ID )  const 
{
  if ( this == NULL ) 
  {
    cout << "The Node is NULL" << endl;
    return 1000;
  }

  if ( element != NULL ) 
  {
    if ( element->_id != NULL ) 
    {
      return -1 *( element->_id->compare( ID ) );
    } 
    else 
    {
      return -50;
    }
  } 
  else 
  {
    return -100;
  }
}

inline int BinNode::CompareID( DBase& db )  const 
{
  return CompareID( *db._id );
}

inline BinNode* BinNode::leftchild()  const 
{
    return left; 
}

inline BinNode* BinNode::rightchild() const 
{
    return right; 
}

inline bool BinNode::valid() const   // Return TRUE if element is not NULL
{
  return ( element != NULL );
}

DBase& BinNode::value() 
{ 
  if ( this == NULL ) 
  {
    DBase* temp = new DBase();
    cout << "The Node is NULL" << endl;
    return *temp;
  }
  
  return *element; 
}

DBase* BinNode::getElem() 
{
  if ( this == NULL ) 
  {
    cout << "The Node is NULL" << endl;
    return NULL;
  }
  
  return element; 
}

inline void BinNode::setValue( DBase& val ) 
{ 
  element = new DBase( val ); 
}

inline bool BinNode::isLeaf() const        // Return TRUE if is a leaf
{
  return (left == NULL) && (right == NULL); 
}

void* BinNode::operator new(size_t) 
{
  if (freelist == NULL) 
    return(::new BinNode);

  BinNode* temp = freelist;
  freelist = freelist->left;
  return temp;
}

void BinNode::operator delete(void* ptr) 
{
  ((BinNode*)ptr)->left = freelist;
  freelist = (BinNode*)ptr;
}

---