BSTHomework/prog.cpp at master · alierdogan7/BSTHomework · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include <iostream>
using namespace std;

#include "NgramTree.h"

int main()
{
    NgramTree ngt;

    /*ngt.addNgram("this");
    ngt.addNgram("samp");
    ngt.addNgram("ampl");
    ngt.addNgram("text");
    ngt.addNgram("mple");
    ngt.addNgram("hise");
    ngt.addNgram("hise");
    ngt.addNgram("samp");
    */

    ngt.generateTree( string("a"), 4);

    int id = 0;
    ngt.print(ngt.getRoot(), id);

    ngt.printNgramFrequencies();

    cout << "\n Total n-gram count: " << ngt.getTotalNgramCount() << endl;

    //cout << "\n Is complete tree? " << ( (ngt.isComplete()) ? "Yes" : "No" ) << endl;

    NgramTree ngt2;
    ngt2.addNgram("f");
    ngt2.addNgram("c");
    ngt2.addNgram("j");
    ngt2.addNgram("a");
    ngt2.addNgram("d");
    ngt2.addNgram("g");
    ngt2.addNgram("k");

    int id2 = 0;
    ngt2.print(ngt2.getRoot(), id2);

    cout << "\n Is second tree complete? " << ( (ngt2.isComplete()) ? "Yes" : "No" ) << endl;


    return 0;
}