Sorted-Vector-and-RBTree/maintree.cpp at master · hschu12/Sorted-Vector-and-RBTree · 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 "rbtree.hpp"
#include <iostream>
int main()
{

	DM852::RBtree<int, int> tree;
	std::pair<int, int> pair = std::make_pair(4,4);
	tree.insert(pair);
	pair = std::make_pair(5,5);
	tree.insert(pair);
	pair = std::make_pair(6,6);
	tree.insert(pair);
	pair = std::make_pair(1,1);
	tree.insert(pair);
	pair = std::make_pair(3,3);
	tree.insert(pair);
	pair = std::make_pair(2,2);
	tree.insert(pair);

	std::cout << "done inserting" << std::endl;

	//std::cout << "begin is " << (*(tree.begin())).data << std::endl;
	//std::cout << "end is " << (*(tree.end())).data << std::endl;

	auto it = tree.begin();
	std::cout << "it data " << it->data << std::endl;
	++it;
	std::cout << "it data " << it->data << std::endl;
	++it;
	std::cout << "it data " << it->data << std::endl;
	++it;
	std::cout << "it data " << it->data << std::endl;
	++it;
	std::cout << "it data " << it->data << std::endl;
	++it;
	std::cout << "it data " << it->data << std::endl;
	++it;
	std::cout << "it data " << it->data << std::endl;
	/*++it;
	std::cout << "it data " << it->data << std::endl;*/

	//std::cout << tree.root->color << " with value "<< tree.root->data << std::endl;

	//tree.printTree(tree.root);

	return 0;
}