binary_search_tree_t< key_t, value_t > Class Template Reference

#include <BinarySearchTree.hpp>

Public Member Functions
	binary_search_tree_t ()=default
void	pre_order_traversal (handler_t< key_t, value_t > handler)
void	in_order_traversal (handler_t< key_t, value_t > handler)
void	post_order_traversal (handler_t< key_t, value_t > handler)
void	clear ()
void	insert (const key_t &key, const value_t &value)
void	remove (const key_t &key)
std::shared_ptr< binary_search_tree_node_t< key_t, value_t > >	search (const key_t &key)
std::shared_ptr< binary_search_tree_node_t< key_t, value_t > >	minimum ()
std::shared_ptr< binary_search_tree_node_t< key_t, value_t > >	maximum ()
int	height ()
int	size ()

Constructor & Destructor Documentation

binary_search_tree_t()

template<typename key_t , typename value_t >

binary_search_tree_t< key_t, value_t >::binary_search_tree_t ( )

default

Member Function Documentation

clear()

template<typename key_t , typename value_t >

void binary_search_tree_t< key_t, value_t >::clear ( )

inline

height()

template<typename key_t , typename value_t >

int binary_search_tree_t< key_t, value_t >::height ( )

inline

in_order_traversal()

template<typename key_t , typename value_t >

void binary_search_tree_t< key_t, value_t >::in_order_traversal ( handler_t< key_t, value_t >  handler )

inline

insert()

template<typename key_t , typename value_t >

void binary_search_tree_t< key_t, value_t >::insert ( const key_t &  key, const value_t &  value  )

inline

maximum()

template<typename key_t , typename value_t >

std::shared_ptr< binary_search_tree_node_t< key_t, value_t > > binary_search_tree_t< key_t, value_t >::maximum ( )

inline

minimum()

template<typename key_t , typename value_t >

std::shared_ptr< binary_search_tree_node_t< key_t, value_t > > binary_search_tree_t< key_t, value_t >::minimum ( )

inline

post_order_traversal()

template<typename key_t , typename value_t >

void binary_search_tree_t< key_t, value_t >::post_order_traversal ( handler_t< key_t, value_t >  handler )

inline

pre_order_traversal()

template<typename key_t , typename value_t >

void binary_search_tree_t< key_t, value_t >::pre_order_traversal ( handler_t< key_t, value_t >  handler )

inline

remove()

template<typename key_t , typename value_t >

void binary_search_tree_t< key_t, value_t >::remove ( const key_t &  key )

inline

search()

template<typename key_t , typename value_t >

std::shared_ptr< binary_search_tree_node_t< key_t, value_t > > binary_search_tree_t< key_t, value_t >::search ( const key_t &  key )

inline

size()

template<typename key_t , typename value_t >

int binary_search_tree_t< key_t, value_t >::size ( )

inline

---

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

• include/BinarySearchTree/BinarySearchTree.hpp