fin

Author: Domain314

CMakeLists.txt

@@ -3,4 +3,4 @@ project(AVLTree)
 
 set(CMAKE_CXX_STANDARD 23)
 
-add_executable(AVLTree avltree/main.cpp avltree/Holder.cpp avltree/Holder.hpp avltree/Node.cpp avltree/Node.hpp avltree/AVLManager.cpp avltree/AVLManager.hpp avltree/Display.cpp avltree/Display.hpp Binary-Tree-RecursiveFun.cpp)
+add_executable(AVLTree avltree/main.cpp avltree/Holder.cpp avltree/Holder.hpp avltree/Node.cpp avltree/Node.hpp avltree/AVLManager.cpp avltree/AVLManager.hpp avltree/Display.cpp avltree/Display.hpp avltree/Menu.cpp avltree/Menu.hpp)

IMPORT-DATA0.txt

@@ -0,0 +1,10 @@
+5
+3
+17
+9
+23
+54
+11
+79
+30
+12

IMPORT-DATA6.txt

@@ -0,0 +1,10 @@
+5
+3
+17
+9
+23
+54
+11
+79
+30
+12

IMPORT-DATA_SINGLE.txt

@@ -0,0 +1 @@
+5

IMPORT-DATA_Subtree2false.txt

@@ -0,0 +1,7 @@
+16
+4
+3
+31
+18
+19
+495

IMPORT-DATA_Subtree2true.txt

@@ -0,0 +1,6 @@
+16
+4
+3
+31
+18
+19

IMPORT-DATA_unbalanced1.txt

@@ -0,0 +1,15 @@
+15
+5
+6
+20
+18
+94
+98
+29
+28
+78
+23
+47
+81
+40
+83

IMPORT-DATA_unbalanced2.txt

@@ -0,0 +1,11 @@
+60
+97
+88
+67
+35
+40
+2
+26
+22
+27
+6

avltree/AVLManager.cpp

@@ -1,42 +1,42 @@
 #include "AVLManager.hpp"
 
-AVLManager::AVLManager() {
-    setupTree();
-}
+AVLManager::AVLManager() {}
 
-void AVLManager::setupTree() {
-    feedNewTree();
-    display = new Display();
-    display->printTree(holders.at(0));
-    display->printDisplays();
-    delete display;
-    holders.clear();
-    setupTree();
+// try to load tree from save, by index. make a new tree, if not saved yet
+Holder* AVLManager::getTree(string command) {
+    try {
+        int index = stoi(command);
+        if (command.length() == 1 && (holders.size()-1) >= index) {
+            return holders.at(stoi(command));
+        }
+    } catch (...) {}
+    int res = feedNewTree(command);
+    if (res != -1) return holders.at(res);
+    else return nullptr;
 }
 
-void AVLManager::feedNewTree() {
-    string path;
-//    path = "/home/domain/Nextcloud/Documents/Technikum/2_Semester/ALGOS/AVLTree/IMPORT-DATA5.txt";
-    cout << "Feed the tree! (Drag&Drop): ";
-    cin >> path;
-
+// feed a tree with data
+int AVLManager::feedNewTree(string path) {
     ifstream inFile(path, ios::in);
     if( inFile.fail( ) ) {
         cerr << "Error: Datei nicht gefunden oder kann nicht geöffnet werden:\n->" << path <<endl;
-        feedNewTree();  // Error;
+        return -1;  // Error;
     } else {
         Holder* holder = new Holder();
-
         string lineStr;
         while (getline(inFile, lineStr)) {
             int error = holder->insertNode(stoi(lineStr));
             if (error == 0) continue;
             else printError(error);
         }
         holders.push_back(holder);
+        holder->getAVLCondition(holder->getHead());
+        std::cout << "\nTree successfully added and saved at " << holders.size()-1 << ".\n\n";
+        return (holders.size()-1);
     }
 }
 
+// some error prints
 void AVLManager::printError(int error) {
     switch (error) {
         case 1: std::cout << "Error 1: Duplicate Numbers >:(" << endl; break;

avltree/AVLManager.hpp

@@ -6,20 +6,22 @@
 #include <fstream>
 #include <iostream>
 #include "Holder.hpp"
-#include "Display.hpp"
+
 
 using namespace std;
 
 class AVLManager {
 public:
     AVLManager();
-    void feedNewTree();
-    void printError(int error);
+    Holder* getTree(string command);
+
 
 private:
-    void setupTree();
+    int feedNewTree(string path);
+    void printError(int error);
+
     std::vector<Holder*> holders;
-    Display* display;
+
 };
 
 

avltree/Display.cpp

@@ -1,20 +1,30 @@
 #include "Display.hpp"
 //#define clearScreen() (std::cout << "\033c")
+#define WAIT_TIME 300000    // 500000 = 0,5sek
 
+Display::Display(Holder* holder) {
+    printTree(holder);
+}
+
+// display preps, prints and self-destruct.
 void Display::printTree(Holder* holder) {
     int depth = holder->getDepth(holder->getHead());
-    int maxNumDigits = getDigits(holder->getMaxNum(holder->getHead()));
+    int maxNumDigits = getDigits(holder->getMinMaxNum(holder->getHead(), true));
 
     for (int i = 0; i < depth+1; ++i) {
         displays.push_back("");
     }
     calcEmptySpaces(depth, maxNumDigits);
     recursiveDraw(depth, maxNumDigits, holder->getHead());
-//    printDisplays();
+
+    usleep(WAIT_TIME);
+    printDisplays();
+    delete this;
 }
 
+// draw one node after another
 void Display::recursiveDraw(int depth, int maxNumDigits, Node* node) {
-    usleep(500000);
+    usleep(WAIT_TIME);
     printDisplays();
     if (depth < 0) return;
     int emptySpace = getEmptySpace(depth);
@@ -38,6 +48,8 @@ void Display::recursiveDraw(int depth, int maxNumDigits, Node* node) {
     if (maxNumDigits == 1 || maxNumDigits == 3)
         displays.at(depth).append(" ");
 }
+
+// draw empty space, where nodes should've been
 void Display::recursiveDraw(int depth, int maxNumDigits) {
     int emptySpace = getEmptySpace(depth);
     displays.at(depth).append(emptySpace, ' ');
@@ -50,6 +62,7 @@ void Display::recursiveDraw(int depth, int maxNumDigits) {
     displays.at(depth).append(emptySpace, ' ');
 }
 
+// Node: (1) (2) ..
 std::string Display::drawNode(Node* node, int maxNumDigits) {
     int digits = getDigits(node->num);
     if (maxNumDigits == digits)
@@ -65,13 +78,16 @@ std::string Display::drawNode(Node* node, int maxNumDigits) {
     return " ";
 }
 
+// check how much digits the largest num in tree has
 int Display::getDigits(int num) {
     if (num >= 1000) return 4;
     if (num >= 100) return 3;
     if (num >= 10) return 2;
     return 1;
 }
 
+// based on digit-amount of largest num in tree,
+// decide which number-sequence to take for [empty space]-calculations
 void Display::calcEmptySpaces(int depth, int maxNumDigits) {
     emptySpaces.clear();
 
@@ -100,6 +116,8 @@ void Display::calcEmptySpaces(int depth, int maxNumDigits) {
     }
 }
 
+// 3 formulas for number sequences to calculate spaces for given tree-depth
+// n = (n*2)+2
 int Display::recursiveSingleSpace(int depth, int maxDepth, int num) {
     if (depth < maxDepth) {
         return recursiveSingleSpace(depth+1, maxDepth, (num*2)+2);
@@ -108,6 +126,7 @@ int Display::recursiveSingleSpace(int depth, int maxDepth, int num) {
     }
 }
 
+// n = n+3*2^d
 int Display::recursiveDoubTripSpace(int depth, int maxDepth, int num) {
     if (depth < maxDepth) {
         return recursiveDoubTripSpace(depth+1, maxDepth, (num+3*(int)std::pow(2,depth)));
@@ -116,6 +135,7 @@ int Display::recursiveDoubTripSpace(int depth, int maxDepth, int num) {
     }
 }
 
+// n = (2*n)+3
 int Display::recursiveQuadSpace(int depth, int maxDepth, int num) {
     if (depth < maxDepth) {
         return recursiveQuadSpace(depth+1, maxDepth, ((2*num)+3));
@@ -124,11 +144,11 @@ int Display::recursiveQuadSpace(int depth, int maxDepth, int num) {
     }
 }
 
+// return number of spaces for given depth
 int Display::getEmptySpace(int depth) {
     return emptySpaces.at(depth);
 }
 
-
 void Display::printDisplays() {
     std::cout << "\033c";
     for (int i = 0; i < displays.size(); ++i) {

avltree/Display.hpp

@@ -11,6 +11,8 @@
 
 class Display {
 public:
+    Display(Holder* holder);
+private:
     void printTree(Holder* holder);
     void recursiveDraw(int depth, int maxNumDigits, Node* node);
     void recursiveDraw(int depth, int maxNumDigits);