HuffmanCPP/tree.h at master · tisOO/HuffmanCPP · 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
#pragma once
#include <queue>
#include "Huffman.h"
#include <vector>

//class for binary tree

//bool compar(bi_tree* l1, bi_tree* l2);

class compar;

class bi_tree
{
public:
	//êîíñòðóêòîð
	bi_tree(long int x, char sym_);
	//äåñòðóêòîð
//	~bi_tree();
	//ôóíêöèÿ ñîçäàíèÿ äåðåâà èç çàäàííîé î÷åðåäè ïî ïðèîðèòåòàì
	static bi_tree* createtree(std::priority_queue<bi_tree*, std::vector<bi_tree*>, compar> que_freq);
//	friend class compar;
	long int get_item() const;
	//îáõîä äåðåâà
	std::vector<std::pair<std::vector<bool>,char>> bi_tree::traverse_tree();

//ïåðåìåííûå
private:
	long int item;
	char sym;
	bi_tree* parent;
	bi_tree* lchild;
	bi_tree* rchild;
};


//bool compar(bi_tree* l1, bi_tree* l2)
//{
//	return l1->get_item() > l2->get_item();
//}
//êëàññ ôóíêòîðà, íåîáõîäèìûé äëÿ ñðàâíåíèÿ ÷àñòîò, ïîíàäîáèòñÿ â î÷åðåäè ñ ïðèîðèòåòîì

class compar
{
public:
	bool operator() ( const bi_tree* l1, const bi_tree* l2 )
	{
		return l1->get_item() > l2->get_item();
	}
};