-
Notifications
You must be signed in to change notification settings - Fork 0
/
ordered_set.cpp
65 lines (59 loc) · 1.35 KB
/
ordered_set.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
#include <algorithm>
#include <iostream>
#include <sstream>
#include "ordered_set.hpp"
void ordered_set::insert(double x)
{
ordered_set::node* new_root = new ordered_set::node(x, 0, 0);
ordered_set::node* null_node = new ordered_set::node(0, 0, 0);
ordered_set::node* curr(root);
if(size == 0)
{
root = new_root;
++size;
return;
}
while(curr != NULL)
{
null_node = curr;
if(x < curr->val)
curr = curr->left;
else
curr = curr->right;
}
if(x < null_node->val)
{
null_node->left = new ordered_set::node(x, 0, 0);
++size;
}
else
{
null_node -> right = new ordered_set::node(x, 0, 0);
++size;
}
}
std::vector<double> answer;
void sorter(ordered_set::node*& n)
{
if(n != NULL)
{
sorter(n->left);
answer.push_back(n->val);
sorter(n->right);
}
}
//void sort ( RandomAccessIterator first, RandomAccessIterator last )
/*OutputIterator merge ( InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result )*/
std::vector<double>* ordered_set::sort()
{ //Yeah, I did it ghetto... so what!
//std::cout << "test" << std::endl;
ordered_set::node* curr(root);
std::vector<double> child;
sorter(curr);
child = answer;
std::vector<double>* ans = new std::vector<double>(child);
std::sort(ans->begin(),ans->end());
return ans;
}