AlgoPlus v0.1.0
Loading...
Searching...
No Matches
tree< T > Class Template Reference

tree class More...

#include <tree.h>

Classes

class  Iterator
 

Public Member Functions

 tree (std::vector< std::pair< std::string, T > > v={}) noexcept
 constructor for tree class
 
void insert (std::string direction, T info)
 insert function
 
bool search (T key)
 search function
 
Iterator begin ()
 
Iterator end ()
 
std::vector< T > inorder ()
 inorder traversal
 
std::vector< T > postorder ()
 postorder function
 
std::vector< T > preorder ()
 preorder function
 
std::vector< std::vector< T > > level_order ()
 level order function
 

Friends

std::ostream & operator<< (std::ostream &out, tree< T > &t)
 operator << for bst class
 

Detailed Description

template<typename T>
class tree< T >

tree class

Constructor & Destructor Documentation

◆ tree()

template<typename T>
tree< T >::tree ( std::vector< std::pair< std::string, T > > v = {})
inlineexplicitnoexcept

constructor for tree class

Parameters
vthe input vector of pairs(string and T) to avoid doing multiple insertions

Member Function Documentation

◆ inorder()

template<typename T>
std::vector< T > tree< T >::inorder ( )
inline

inorder traversal

Returns
vector<T>: the inorder traversal of the tree

◆ insert()

template<typename T>
void tree< T >::insert ( std::string direction,
T info )
inline

insert function

Parameters
directionstring, directions for the insertion of value info
infothe value of the new node

◆ level_order()

template<typename T>
std::vector< std::vector< T > > tree< T >::level_order ( )
inline

level order function

Returns
vector<vector<T>>: the level order traversal of the tree

◆ postorder()

template<typename T>
std::vector< T > tree< T >::postorder ( )
inline

postorder function

Returns
vector<T>: the postorder traversal of the tree

◆ preorder()

template<typename T>
std::vector< T > tree< T >::preorder ( )
inline

preorder function

Returns
vector<T>: the preorder traversal of the tree

◆ search()

template<typename T>
bool tree< T >::search ( T key)
inline

search function

Parameters
keythe key to be searched
Returns
true: if the key exist in the tree
false: otherwise

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