Node.h

/*
 * This file is part of dsa-decision-tree
 *
 * Developed for the DSA UET course.
 * This project was developed by Ba Luong and Gia Linh.
 */

#pragma once
#ifndef NODE_H
#define NODE_H

#include "Data.h"
#include "CostCalc.h"
#include "BitMask.h"
#include "SplitData.h"
#include <math.h>

using namespace std;

class Node
{
public:
    Node *left;
    Node *right;
    int code;

    virtual bool isTerminal() = 0;
    virtual bool compare(Data *data) = 0;
    virtual char getLabel() = 0;
    virtual string toString() = 0;
    virtual void setCode(int _code) = 0;
    virtual string getExport() = 0;

    Node(int _code = 0) : code(_code) { left = right = NULL; }
    virtual ~Node()
    {
        delete left;
        delete right;
    }
};

SplitData::GroupSplitData getSplit(vector<Data *> *dataset, SplitData::SPLIT_VAL method = SplitData::COMPARISON);

SplitData::GroupSplitData getRandomSplit(vector<Data *> *dataset, SplitData::SPLIT_VAL method = SplitData::COMPARISON);

char toTerminal(DataSet *data);

// Create child splits for a node or make terminal
void split(Node *&node, DataSet *dataset, int minSize, int maxDepth, int depth);

#endif