sspt_AVLTree< K, T > Class Template Reference

depth balanced binary tree More...

#include <sspt_avltree.h>

List of all members.

Public Member Functions
	sspt_AVLTree ()
	~sspt_AVLTree ()
bool	find (const K &key, T *buffer)
bool	insert (const K &key, const T &item)
bool	remove (const K &key)
sspt_AVLIterator< K, T >	begin () const
sspt_AVLNode< K, T > *	root () const
void	clear ()

---

Detailed Description

template<class K, class T>
class sspt_AVLTree< K, T >

depth balanced binary tree

---

Constructor & Destructor Documentation

template<class K, class T>

sspt_AVLTree< K, T >::sspt_AVLTree

(

)

[inline]

template<class K, class T>

sspt_AVLTree< K, T >::~sspt_AVLTree

(

)

[inline]

---

Member Function Documentation

template<class K, class T>

sspt_AVLIterator<K,T> sspt_AVLTree< K, T >::begin

(

)

const [inline]

template<class K, class T>

void sspt_AVLTree< K, T >::clear

(

)

[inline]

template<class K, class T>

bool sspt_AVLTree< K, T >::find	(	const K &	key,
		T *	buffer
	)			[inline]

template<class K, class T>

bool sspt_AVLTree< K, T >::insert	(	const K &	key,
		const T &	item
	)			[inline]

template<class K, class T >

bool sspt_AVLTree< K, T >::remove

(

const K &

key

)

[inline]

template<class K, class T>

sspt_AVLNode<K,T>* sspt_AVLTree< K, T >::root

(

)

const [inline]