PUBLIC

BinaryTreeUpIterC::BinaryTreeUpIterC(const BinaryTreeC &) BinaryTreeUpIterC::BinaryTreeUpIterC(void) BinaryTreeUpIterC::operator =(const BinaryTreeC &) BinaryTreeUpIterC::First(void) BinaryTreeUpIterC::Next(void) BinaryTreeUpIterC::operator ++(int) BinaryTreeUpIterC::Data(void) BinaryTreeUpIterC::Data(void) const BinaryTreeUpIterC::Key(void) const BinaryTreeUpIterC::IsElm(void) const BinaryTreeUpIterC::operator bool(void) const BinaryTreeUpIterC::operator *(void) BinaryTreeUpIterC::operator ->(void) BinaryTreeUpIterC::Remove(void)

BinaryTreeC tree;

BlkStackC *> stk;

BinaryTreeUpIterC(const BinaryTreeC<KeyT,DataT> & ntree)

Constructor

BinaryTreeUpIterC()

Default constructor.

const BinaryTreeC<KeyT,DataT> & operator =(const BinaryTreeC<KeyT,DataT> & ntree)

Assignment from another binary tree.

bool First()

Goto smallest element in the tree.

bool Next()

Goto next smallest key in the tree.

void operator ++(int)

Goto next smallest key in the tree

DataT & Data()

Access data.

const DataT & Data() const

Access data.

const KeyT & Key() const

Access data.

bool IsElm() const

Test if we're at a valid element.

operator bool() const

Test if we're at a valid element.

DataT & operator *()

Access data.

DataT * operator ->()

Access data.

void Remove()

Delete this node.
NB. This uses lazy deletion, it only flags the node as removed, it does not free any memory. FIXME:- This may cause MaxNode and MinNode to fail.