BinaryTree/BinaryTree.cpp at main · mrnickzh/BinaryTree · 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
48
49
50
51
52
#include "BinaryTree.h"

BinaryTree::BinaryTree(int val) {
	left = nullptr;
	right = nullptr;
	value = val;
};

void BinaryTree::insert(int val) {
	BinaryTree* tmp = new BinaryTree(val);
	if (val > value) {
		if (right)
			right->insert(val);
		else
			right = tmp;
	};
	if (val < value) {
		if (left)
			left->insert(val);
		else
			left = tmp;
	};
};

bool BinaryTree::find(int val) {
	if (val == value)
		return true;
	else if (val > value) {
		if (right)
			right->find(val);
		else
			return false;
	}
	else if (val < value) {
		if (left)
			left->find(val);
		else
			return false;
	};
};

void BinaryTree::print() {
	std::cout << "VALUE: " << value << std::endl;
	if (right){
		std::cout << "RIGHT ";
		right->print();
	};
	if (left){
		std::cout << "LEFT ";
		left->print();
	};
};