BinarryTreeOriginal/Node.cpp at master · borshblack/BinarryTreeOriginal · 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
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
#include "stdafx.h"
#include "Node.h"
#include <iostream>

using namespace std;

Node::Node(const int data, const int dData)
{
	this->value = data;
	this->dData = dData;
}
Node::Node()
{
	int val;
	cout << "Введите значение узла двоичного дерева: ";
	cin >> val;
	cout << "\n";
	int dData;
	cout << "Введите какое-нибудь дополнительное значение узла: ";
	cin >> dData;
	cout << "\n";
}

int Node::getValue()
{
	if (this != NULL)
	{
		return value;
	}
	return NULL;
}

int Node::getData()
{
	if (dData)
	{
		return dData;
	}
	return -100001;
}

Node *& Node::getParent()
{
	return parent;
}

Node *& Node::getLeftChild()
{
	return this->leftChild;
}

Node *& Node::getRightChild()
{
	return this->rightChild;
}

void Node::setLeftChild(Node * node)
{
	this->leftChild = node;
}

void Node::setRightChild(Node * node)
{
	this->rightChild = node;
}

void Node::setParent(Node * node)
{
	parent = node;
}

void Node::deleteNode()
{
	setLeftChild(NULL);
	setRightChild(NULL);
	value = NULL;
	dData = NULL;
}

Node::~Node()
{
}