Tree< K, E >::IteratorNode Class Reference

#include <Tree.h>

Collaboration diagram for Tree< K, E >::IteratorNode:

Public Member Functions
	IteratorNode (Node *node, Node *prev, size_t n)
IteratorNode *	next ()
IteratorNode *	previous ()
void	reset (Node *node, Node *prev, size_t n)

Public Attributes
Node *	value

Private Member Functions
void	traverseNext ()

Private Attributes
Node *	pNode
Node *	pPreviousNode

Detailed Description

template<class K, class E>
class Tree< K, E >::IteratorNode

Todo:

This will actually mean for each Tree you can only use one iterator at a time, which may not be effective depending on how this is used.

Definition at line 51 of file Tree.h.

---

The documentation for this class was generated from the following file:

• Tree.h