Feat/new datastructures

CMakeLists.txt

@@ -20,7 +20,9 @@ target_include_directories(mlcpppy PUBLIC ${PROJECT_SOURCE_DIR}/include)
 # -------------------------------
 add_executable(example_main examples/main.cpp)
 add_executable(example_instance examples/atributes_usage.cpp)
+add_executable(example_binary_tree examples/example_binary_tree.cpp)
 
 # Linka a biblioteca ao executável
 target_link_libraries(example_main PRIVATE mlcpppy)
 target_link_libraries(example_instance PRIVATE mlcpppy)
+target_link_libraries(example_binary_tree PRIVATE mlcpppy)

examples/atributes_usage.cpp

@@ -1,13 +1,13 @@
 #include <iostream>
+
 #include "mlcpppy/instances/instances.h"
 
-int main(int argc, char const *argv[])
-{
-    // Exemplo de uso da classe atribute, instances e instance
-    Instance a(Attribute(1), Attribute(2.5), Attribute("Pedro"));
-    Instance b(Attribute(1), Attribute(2.5), Attribute("Pedro"));
-    Instance c(Attribute(1), Attribute(2.5), Attribute("Pedro"));
-    Instances matrix({a,b,c});
-    std::cout << matrix << std::endl;
-    return 0;
+int main(int argc, char const *argv[]) {
+        // Exemplo de uso da classe atribute, instances e instance
+        Instance a(Attribute(1), Attribute(2.5), Attribute("Pedro"));
+        Instance b(Attribute(1), Attribute(2.5), Attribute("Pedro"));
+        Instance c(Attribute(1), Attribute(2.5), Attribute("Pedro"));
+        Instances matrix({a, b, c});
+        std::cout << matrix << std::endl;
+        return 0;
 }

examples/example_binary_tree.cpp

@@ -0,0 +1,28 @@
+#include "mlcpppy/data_structures/binary_tree.h"
+
+int main(int argc, char const* argv[]) {
+        BinaryTree<int>* binary_tree = new BinaryTree<int>();
+        // Isso deixa desbalanceado
+        // 20, 8, 22, 4, 12, 10, 14
+
+        binary_tree->Insert(20);
+        binary_tree->Insert(8);
+        binary_tree->Insert(22);
+        binary_tree->Insert(4);
+        binary_tree->Insert(12);
+        binary_tree->Insert(10);
+        binary_tree->Insert(14);
+
+        binary_tree->TreeSuccessor();
+
+        binary_tree->Inorder();
+
+        BinaryTree<int>::Node* busca = binary_tree->Search(8);
+        if (busca) {
+                binary_tree->Delete(busca);
+        }
+
+        binary_tree->Inorder();
+
+        return 0;
+}