-
Notifications
You must be signed in to change notification settings - Fork 0
/
Tree.cpp
91 lines (72 loc) · 1.56 KB
/
Tree.cpp
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include "Tree.h"
#include<cstdio>
#include<vector>
#include<iostream>
using namespace std;
Tree::Tree(Node x) {
left = nullptr;
right = nullptr;
node = Node(x.getNode());
word = "";
}
Tree::~Tree() {
delete(left);
delete(right);
}
void Tree::addNewNodeToTree(Node x) {
}
vector<double> Tree::getRootRepresentation() {
vector<double> rootRepresentation = this->node.getNode();
return rootRepresentation;
}
void Tree::setLeftTree(Tree* x) {
this->left = x;
}
void Tree::setRightTree(Tree* x) {
this->right = x;
}
void Tree::setRoot(Node x) {
this->node = x;
}
void Tree::setRoot(vector<double> x) {
Node* n = new Node(x);
this->node = *n;
delete(n);
}
void Tree::setScore(vector<double> s) {
this->score = s;
}
void Tree::setWord(string x) {
this->word = x;
}
Tree* Tree::getLeftTree() {
return this->left;
}
Tree* Tree::getRightTree() {
return this->right;
}
vector<double> Tree::getScore() {
return this->score;
}
string Tree::getWord() {
return this->word;
}
// Recursive method for printing a tree.
void printTree(Tree* t) {
if (t == nullptr) return;
cout<<"(";
cout<<"Root ";
vector<double> nodeRep = t->getRootRepresentation();
for (int i = 0; i < nodeRep.size();i++) {
cout<<nodeRep[i]<<" ";
}
if (t->getLeftTree() == nullptr) cout<<t->getWord()<<" ";
printTree(t->getLeftTree());
printTree(t->getRightTree());
cout<<")";
}
// Print the elements of the tree in-order.
void Tree::inOrderTraversal() {
printTree(this);
cout<<endl;
}