Prac3_ScapeGoat.cpp

// Rebalancing operation can be delayed until a certain threshold is attained. 
// Scapegoat tree uses partial rebuilding for balancing a search tree. 
// Implement scapegoat tree to demonstrate the partial rebuilding operation.

#include "ScapeGoat.h"
#include <iostream>

int main(){
    ScapeGoat data("Ajino Motado");
    
    // data.AddData("data.csv", 1);
    int arr[]={30, 27, 25, 20, 16,15, 10 , 6 , 5 , 3, 1};
    // int arr[]={11,10,9,8,7,6,5,4,3,2,1};
    for (int i = 0; i < 11; i++)
    {
        data.insert(arr[i],i*10);
        data.PrettyPrinting();
        std::cout << std::endl;
    }
    
    // data.traverse();
    data.PrettyPrinting();

    // std::cout << "Searching" << std::endl;
    // std::cout << "================" << std::endl;
    // std::cout << data.search(809) << std::endl;

    // std::cout << "After Deleting Some Keys" << std::endl;
    // data.deleteKey(5);
    // data.deleteKey(3);
    // data.deleteKey(0);
    // data.deleteKey(1);
    // data.PrettyPrinting();
    // data.deleteKey(9);
    // data.deleteKey(7);
    // data.PrettyPrinting();

    return 0;
}