GlobeEngine
Public Member Functions | Protected Attributes | List of all members
geData::BintreeNode< T > Class Template Reference

#include <BintreeNode.h>

Inheritance diagram for geData::BintreeNode< T >:
geData::BinarySearchTreeNode< T >

Public Member Functions

 BintreeNode (T _data)
 
 ~BintreeNode ()
 
const T getData () const
 
void setData (T data)
 
BintreeNode< T > * getParent ()
 
void setParent (BintreeNode< T > *node)
 
BintreeNode< T > * getLeft ()
 
BintreeNode< T > * getRight ()
 
void setLeft (BintreeNode< T > *node)
 
void setRight (BintreeNode< T > *node)
 
BintreeNode< T > * search (T data)
 
BintreeNode< T > * searchLeftElement ()
 
BintreeNode< T > * searchRightElement ()
 
BintreeNode< T > * findInorderSuccessor ()
 
BintreeNode< T > * findInorderPredeccessor ()
 
virtual void printValue ()
 
virtual void printInorder ()
 
virtual void printPostorder ()
 
virtual void printEuler ()
 
virtual bool insert (T data)
 
virtual bool remove (T data)
 
virtual bool operator< (const BintreeNode< T > &node) const
 
virtual bool operator> (const BintreeNode< T > &node) const
 
virtual bool operator== (const BintreeNode< T > &node) const
 

Protected Attributes

T data
 
BintreeNode< T > * left
 
BintreeNode< T > * right
 
BintreeNode< T > * parent
 

Constructor & Destructor Documentation

template<class T>
geData::BintreeNode< T >::BintreeNode ( T  _data)
inline
template<class T>
geData::BintreeNode< T >::~BintreeNode ( )
inline

Member Function Documentation

template<class T>
BintreeNode<T>* geData::BintreeNode< T >::findInorderPredeccessor ( )
inline
template<class T>
BintreeNode<T>* geData::BintreeNode< T >::findInorderSuccessor ( )
inline
template<class T>
const T geData::BintreeNode< T >::getData ( ) const
inline
template<class T>
BintreeNode<T>* geData::BintreeNode< T >::getLeft ( )
inline
template<class T>
BintreeNode<T>* geData::BintreeNode< T >::getParent ( )
inline
template<class T>
BintreeNode<T>* geData::BintreeNode< T >::getRight ( )
inline
template<class T>
virtual bool geData::BintreeNode< T >::insert ( T  data)
inlinevirtual

Reimplemented in geData::BinarySearchTreeNode< T >.

template<class T>
virtual bool geData::BintreeNode< T >::operator< ( const BintreeNode< T > &  node) const
inlinevirtual
template<class T>
virtual bool geData::BintreeNode< T >::operator== ( const BintreeNode< T > &  node) const
inlinevirtual
template<class T>
virtual bool geData::BintreeNode< T >::operator> ( const BintreeNode< T > &  node) const
inlinevirtual
template<class T>
virtual void geData::BintreeNode< T >::printEuler ( )
inlinevirtual
template<class T>
virtual void geData::BintreeNode< T >::printInorder ( )
inlinevirtual
template<class T>
virtual void geData::BintreeNode< T >::printPostorder ( )
inlinevirtual
template<class T>
virtual void geData::BintreeNode< T >::printValue ( )
inlinevirtual

Reimplemented in geData::BinarySearchTreeNode< T >.

template<class T>
virtual bool geData::BintreeNode< T >::remove ( T  data)
inlinevirtual

Reimplemented in geData::BinarySearchTreeNode< T >.

template<class T>
BintreeNode<T>* geData::BintreeNode< T >::search ( T  data)
inline
template<class T>
BintreeNode<T>* geData::BintreeNode< T >::searchLeftElement ( )
inline
template<class T>
BintreeNode<T>* geData::BintreeNode< T >::searchRightElement ( )
inline
template<class T>
void geData::BintreeNode< T >::setData ( T  data)
inline
template<class T>
void geData::BintreeNode< T >::setLeft ( BintreeNode< T > *  node)
inline
template<class T>
void geData::BintreeNode< T >::setParent ( BintreeNode< T > *  node)
inline
template<class T>
void geData::BintreeNode< T >::setRight ( BintreeNode< T > *  node)
inline

Member Data Documentation

template<class T>
T geData::BintreeNode< T >::data
protected
template<class T>
BintreeNode<T>* geData::BintreeNode< T >::left
protected
template<class T>
BintreeNode<T> * geData::BintreeNode< T >::parent
protected
template<class T>
BintreeNode<T> * geData::BintreeNode< T >::right
protected
The documentation for this class was generated from the following file: