Pascal-Datastructures/HeapBinaryTreeNode.pas at master · matthewJamesAbbott/Pascal-Datastructures · 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
//
// Created by Matthew Abbott 31/8/22
//

{$mode objfpc}
{$M+}

unit HeapBinaryTreeNode;

interface

type

    THeapBinaryTreeNode = class
    private
        data, nodeNumber: integer;
        leftChild, rightChild: THeapBinaryTreeNode;

    public
        constructor create();
        procedure setLeftChild(inputNode: THeapBinaryTreeNode);
        function getLeftChild: THeapBinaryTreeNode;
        procedure setRightChild(inputNode: THeapBinaryTreeNode);
        function getRightChild: THeapBinaryTreeNode;
        procedure setData(inputData: integer);
        function getData: integer;
        procedure setNodeNumber(inputNumber: integer);
        function getNodeNumber: integer;
    end;

implementation

constructor THeapBinaryTreeNode.create();
begin
    leftChild := nil;
    rightChild := nil;
end;

procedure THeapBinaryTreeNode.setLeftChild(inputNode: THeapBinaryTreeNode);
begin
    leftChild := inputNode;
end;

procedure THeapBinaryTreeNode.setRightChild(inputNode: THeapBinaryTreeNode);
begin
    rightChild := inputNode;
end;

function THeapBinaryTreeNode.getLeftChild: THeapBinaryTreeNode;
begin
    getLeftChild := leftChild;
end;

function THeapBinaryTreeNode.getRightChild: THeapBinaryTreeNode;
begin
    getRightChild := rightChild;
end;

procedure THeapBinaryTreeNode.setData(inputData: integer);
begin
    data := inputData;
end;

function THeapBinaryTreeNode.getData: integer;
begin
    getData := data;
end;

function THeapBinaryTreeNode.getNodeNumber: integer;
begin
    getNodeNumber := nodeNumber;
end;

procedure THeapBinaryTreeNode.setNodeNumber(inputNumber: integer);
begin
    nodeNumber := inputNumber;
end;
end.