BinaryTree< Item > Class Template Reference

Sorted binary tree for Items that support the "less than" and "equal" operators. More...

#include <BinaryTree.h>

Public Member Functions
void	add (const Item &item)
	Add (copy) Item into the tree.
bool	find (const Item &item)
	Try to find item in tree. More...
void	traverse (void(*visit)(const Item &, void *), void *arg=0)
	Sorted (inorder) traverse, calling visitor routine on each item.

Detailed Description

template<class Item>
class BinaryTree< Item >

Sorted binary tree for Items that support the "less than" and "equal" operators.

Member Function Documentation

template<class Item >

bool BinaryTree< Item >::find ( const Item &  item )

inline

Try to find item in tree.

Returns

true if found.

---

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

• /home/malitsky/projects/epics-archiver/sourceforge/trunk/ea4-cpp/include/common/tools/BinaryTree.h