Search  

---

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

Go to the documentation of this file.

// BinNode.hpp - Binary Search Tree Node Class Interface

#ifndef __BINNODE_HPP__           // Is it defined already !?
#define __BINNODE_HPP__

#include "Const.hpp"
#include "DBase.hpp"
#include "String.hpp"

class BinNode {                // Binary tree node class
public:
  static BinNode* freelist;

  // Two constructors -- with and without initial values
  BinNode();

  BinNode( DBase* e );
  BinNode( DBase* e, BinNode* l );
  BinNode( DBase* e, BinNode* l, BinNode* r );

  virtual ~BinNode();               // Destructor

  BinNode* leftchild()  const;
  BinNode* rightchild() const;

  DBase&   value();

  int      CompareID( String& ID )  const;
  int      CompareID( DBase&  db )  const;

    
  void     setValue(DBase& val);

  bool     isLeaf()   const;        // Return TRUE if is a leaf
  bool     valid()    const;    // Return TRUE if element is not NULL

  DBase*   getElem();

  void* operator new(size_t);       // Overload new  
  void  operator delete(void*);     // Overload delete

  BinNode* left;                    // Pointer to left child
  BinNode* right;                   // Pointer to right child

  // Inline optimization
inline void   display() const       // Display the DBase content
{                                   // on the Screen.
    cout << element->string() << endl;
}

inline friend ostream& operator<<(ostream& os, BinNode* node) { 
  return os << node->element->string() << endl;
}


private:
  DBase*   element;                 // The node's value
};

#endif

---