-
Notifications
You must be signed in to change notification settings - Fork 0
/
MakeTree.cpp
39 lines (34 loc) · 915 Bytes
/
MakeTree.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
// Eli Simmonds
// CS315 Project 4
// MakeTree.cpp
#include "MakeTree.hpp"
#include "GraphNode.hpp"
MakeTree::MakeTree() {
// _root = new TreeNode();
}
GraphNode *MakeTree::find( TreeNode *root, std::string name ) {
if (root == nullptr) {
return nullptr;
}
if (root->graphNode()->getName() == name)
return root->graphNode();
if (root->graphNode()->getName() < name)
return find(root->right(), name);
return find(root->left(), name);
}
TreeNode *MakeTree::insert( TreeNode *tNode, GraphNode *nNode ) {
if ( tNode == nullptr )
return new TreeNode( nNode );
if ( tNode->graphNode()->getName() < nNode->getName() )
tNode->right( insert(tNode->right(), nNode) );
else
tNode->left( insert(tNode->left(), nNode) );
return tNode;
}
void MakeTree::print( TreeNode *root ) {
if (root == nullptr)
return;
print(root->left());
std::cout << root->graphNode()->getName();
print(root->right());
}