// ------------------------------- //
// -------- Start of File -------- //
// ------------------------------- //
// ----------------------------------------------------------- //
// C++ Header File Name: bstreeb.hpp
// Compiler Used: MSVC40, DJGPP 2.7.2.1, GCC 2.7.2.1, HP CPP 10.24
// Produced By: Doug Gaer   
// File Creation Date: 01/23/1997 
// Date Last Modified: 07/28/1998
// Copyright (c) 1997 Douglas M. Gaer
// ----------------------------------------------------------- // 
// ---------- Include File Description and Details  ---------- // 
// ----------------------------------------------------------- // 
/*
The VBD C++ classes are copyright (c) 1997, by Douglas M. Gaer.
All those who put this code or its derivatives in a commercial
product MUST mention this copyright in their documentation for
users of the products in which this code or its derivative
classes are used. Otherwise, you have the freedom to redistribute
verbatim copies of this source code, adapt it to your specific
needs, or improve the code and release your improvements to the
public provided that the modified files carry prominent notices
stating that you changed the files and the date of any change.

THIS SOFTWARE IS PROVIDED "AS IS" WITHOUT WARRANTY OF ANY KIND.
THE ENTIRE RISK OF THE QUALITY AND PERFORMANCE OF THIS SOFTWARE
IS WITH YOU. SHOULD ANY ELEMENT OF THIS SOFTWARE PROVE DEFECTIVE,
YOU WILL ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR, OR
CORRECTION.
  
Abstract binary search tree node functions. These functions
assume the nodes are part of binary search trees, but do not
depend on the data stored in the nodes.
*/
// ----------------------------------------------------------- //   
#ifndef __BSTREEB_HPP
#define __BSTREEB_HPP

#include "bnode.hpp"

// Standalone functions that operate on BNodeBase pointers.
// This implementation provides maximum code sharing.
BNodeBase *Minimum(BNodeBase *Tree);
BNodeBase *Maximum(BNodeBase *Tree);
BNodeBase *ParentOfMinimum(BNodeBase *Tree);
BNodeBase *ParentOfMaximum(BNodeBase *Tree);
BNodeBase *ParentOfPredecessor(BNodeBase *Tree);
BNodeBase *ParentOfSuccessor(BNodeBase *Tree);

BNodeBase *DetachNode
(BNodeBase *&root, BNodeBase *Tree, BNodeBase *p, int Side);

#endif // __BSTREEB_HPP
// ----------------------------------------------------------- // 
// ------------------------------- //
// --------- End of File --------- //
// ------------------------------- //
