PUBLIC

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

BinaryTreeC tree;

BlkStackC *> stk;

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

Constructor

BinaryTreeDownIterC()

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.