Tree.h

#ifndef PRIVPOINTLOC_TREE_H
#define PRIVPOINTLOC_TREE_H

#include <iostream>
#include <fstream>

#include "Node.h"
#include "Segment.h"
#include "Encryptor.h"
#include "PrivPointUtil.h"

// handle cyclic dependencies
class Node; 
class Segment;

class Tree {
public:
    Tree();

    void readSegmentsFile(std::string);


    Node * getRoot();


    int getTreeSize();


    int getTotalTrapezoids();


    void insert(Segment *);


    void printTree(Node *, int = 0);

    void addLeafNodes(Node *);
    
    void deleteLeafNodes(Node *);

    void setupLists(Node *);

    void printLists();

    void initAdjacencyMatrix();

    void writeAdjacencyMatrix(Node *);

    void writeSumsAdjacencyMatrix();
    
    void printAdjacencyMatrix();

    void writeAdjacencyMatrixToFile(std::string);

    void findPoint(int, int, Node *);

    void findPrivatePoint(Encryptor &, PrivPointUtil *, helib::Ctxt , helib::Ctxt &, helib::Ctxt, Node *, int, int);
    
    void cleanTree(Node *);

    void setupPathLabels(Node *, std::string);

    void printPathLabels();

    std::vector<std::string> getAllPaths();
    
    void evaluateOnePath(Encryptor &, PrivPointUtil *, helib::Ctxt, helib::Ctxt &, int, int, std::string);

    void getPathResult(Encryptor &, PrivPointUtil *, helib::Ctxt, helib::Ctxt &, int, int, std::string);

    helib::Ctxt evaluateAllNodes(Encryptor &, PrivPointUtil *, helib::Ctxt, int, int);
private:
    Node * root;
    int size; //total nodes
    int totalTrapezoids;
    int totalSegments;
    std::vector<Node *> pList;
    std::vector<Node *> qList;
    std::vector<Node *> sList;
    std::vector<Node *> tList;
    std::vector<std::vector<std::string>> adjMatrix;
    std::vector<std::string> allPaths;
    int minX, maxX;
};

#endif /*PRIVPOINTLOC_TREE_H*/