-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathClassHeapTreeNode.h
44 lines (38 loc) · 967 Bytes
/
ClassHeapTreeNode.h
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
#ifndef HEAPTREENODE_H
#define HEAPTREENODE_H
#include <iostream>
#include "ClassRecord.h"
using namespace std;
class HeapTreeNode
{
private:
Record* recordPtr;
HeapTreeNode* parentNode;
HeapTreeNode* rightNode;
HeapTreeNode* leftNode;
HeapTreeNode* prevTail;
int occurences;
public:
HeapTreeNode(Record*);
~HeapTreeNode();
Record* getRecordPtr();
HeapTreeNode* getParentNode();
HeapTreeNode* getRightNode();
HeapTreeNode* getLeftNode();
HeapTreeNode* getPrevTail();
int getOccurences();
void setRecordPtr(Record*);
void setParentNode(HeapTreeNode*);
void setRightNode(HeapTreeNode*);
void setLeftNode(HeapTreeNode*);
void setPrevTail(HeapTreeNode*);
void setOccurences(int);
void maxHeapify();
void swap(HeapTreeNode*);
bool contains(Record*);
void increaseKey();
HeapTreeNode* searchNode(Record*);
void revMaxHeapify();
void printHeap(int);
};
#endif