Example

#include "BinarySearchTree/BinarySearchTree.hpp"


#include <iostream>

#include <string>


int main() {

    binary_search_tree_t<int, std::string> tree;


    tree.insert(2, "two");

    tree.insert(4, "four");

    tree.insert(90, "ninety");

    tree.insert(3, "three");

    tree.insert(0, "zero");

    tree.insert(14, "fourteen");

    tree.insert(45, "forty-five");


    tree.pre_order_traversal([](auto key, auto &value) {

        std::cout << key << " -> " << value << std::endl;

    });

    std::cout << std::endl;


    tree.in_order_traversal([](auto key, auto &value) {

        std::cout << key << " -> " << value << std::endl;

    });

    std::cout << std::endl;


    tree.post_order_traversal([](auto key, auto &value) {

        std::cout << key << " -> " << value << std::endl;

    });

    std::cout << std::endl;


    return 0;

}

BinarySearchTree.hpp

binary_search_tree_t
Definition: BinarySearchTree.hpp:49

binary_search_tree_t::post_order_traversal
void post_order_traversal(handler_t< key_t, value_t > handler)
Definition: BinarySearchTree.hpp:61

binary_search_tree_t::in_order_traversal
void in_order_traversal(handler_t< key_t, value_t > handler)
Definition: BinarySearchTree.hpp:57

binary_search_tree_t::pre_order_traversal
void pre_order_traversal(handler_t< key_t, value_t > handler)
Definition: BinarySearchTree.hpp:53

binary_search_tree_t::insert
void insert(const key_t &key, const value_t &value)
Definition: BinarySearchTree.hpp:69