JoaoESmoreira

• g++ ≥ 9.0 or clang++ ≥ 10.0
• C++17 or newer standard

The project defines a BinaryTree data structure and an iterator class that allows traversal of the tree in an in-order sequence. This iterator supports standard C++ operations such as incrementing and dereferencing, enabling usage in range-based loops and STL-like algorithms.

• Implementation of a templated BinaryTree class.
• Support for inserting, searching, and removing elements.
• Custom iterator for in-order traversal.
• Example usage provided in main.cpp.
• Auxiliary string functions defined in str.cpp.

Use any modern C++ compiler (C++17 or higher).

g++ -std=c++17 -O2 -Wall -Wextra -pedantic main.cpp -o binary-tree

#include "binarytree.hpp"
#include 

int main() {
    BinaryTree bt;

    bt.insert(8);
    bt.insert(3);
    bt.insert(10);
    bt.insert(1);
    bt.insert(6);

    std::cout << "In-order traversal using iterator: ";
    for (auto it = bt.begin(); it != bt.end(); ++it)
        std::cout << *it << " ";
    std::cout << std::endl;

    return 0;
}