Search  

---

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

Go to the documentation of this file.

// BST.hpp - Binary Search Tree Class Interface

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

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

class BinSearchTree {

public:
  BinSearchTree();

  virtual  ~BinSearchTree();

  
  void      clear();
  void      insert( DBase* val );
  
  void      remove();
  void      remove( DBase& val );
  int       find(   DBase& val );
  int       findID( String& ID );
  
  bool      isEmpty()  const;
  int       length()   const;
  int       search()   const;
  void      print()    const;                // Without preorder
  void      display()  const;                // With preorder
  
  void      clear(      BinNode*           );   // Helper functions
  void      insert(     BinNode*&, DBase*  );   // for public routines
  BinNode*  deletemin(  BinNode*&          );
  void      remove(     BinNode*&, DBase&  );
  int       find(       BinNode*,  DBase&  );
  int       findID(     BinNode*,  String& );

  void      print(      BinNode*,  int     ) const;
  
  BinNode*  getCurrent();
  DBase*    getValue();

  void      preorder(   BinNode* rt ) const;    // rt is the root of a subtree
  
private:
  BinNode*  current;
  DBase*    currElem;

  BinNode*  root;
  int       NbElements;
  int       searchStep;
};

#endif

---