#ifndef PROJECT10_TREE_H
#define PROJECT10_TREE_H

#include <iostream>

#include <vector>

using namespace std;

class Tree {

private:

    typedef struct Node {

        vector <char> word;
        int count = 0;

        Node* left;
        Node* right;

    }*nPtr;

    nPtr root;

    int length (nPtr p);

    void insert(nPtr& p, vector <char> input);

    void remove(nPtr& p, vector <char> target);

    void remove (nPtr& p);

public:

    Tree(){ root = NULL; }

    bool empty(){ return root == NULL; }

    int length(){ return length(root); }

    bool present(vector <char> target);

    void insert(vector <char> entry){ insert(root, entry); }

    void remove(vector <char> target){ remove(root, target); }

};

int operator < (vector <char> a, vector <char> b);


#endif //PROJECT10_TREE_H