cAbstractDataTypes/GeneralTree.c at main · RotRotAl/cAbstractDataTypes · 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
#include "GeneralTree.h"

void MakeGenralTree(GeneralTreeNode** root, void* val)
{
	*root = (GeneralTreeNode*)malloc(sizeof(GeneralTreeNode));
	(*root)->data = val;
	(*root)->nextsChildsManager = NULL;
}

void SetLeafI(GeneralTreeNode* node, void* value)
{
	GeneralTreeNode* new = (GeneralTreeNode*)malloc(sizeof(GeneralTreeNode));
	new->data = value;
	new->nextsChildsManager = NULL;
	PushLinearLinkedListNode(&node->nextsChildsManager, new);
}

BOOL IsLeafGeneralTreeNode(GeneralTreeNode* node)
{
	return !node->nextsChildsManager;
}

int HowManyNodesGeneralTreeNode(GeneralTreeNode* node)
{
	if (!node)
		return 0;
	int sum = 0;
	LinearLinkedListNode* prog = node->nextsChildsManager;

	while (prog)
	{
		sum += howManyNodesGeneralTreeNode(prog->data) + 1;
		prog = prog->next;
	}
	return sum;
}

int howManyLeafsGeneralTreeNode(GeneralTreeNode* node)
{
	if (!node)
		return 0;
	int sum = 0;
	LinearLinkedListNode* prog = node->nextsChildsManager;

	while (prog)
	{
		sum += howManyLeafsGeneralTreeNode(prog->data) + isLeafGeneralTreeNode(prog);
		prog = prog->next;
	}
	return sum;
}

GeneralTreeNode* FindNodeGeneralTreeNode(GeneralTreeNode* node,void* data,BOOL(*isEql)(void*,void*))
{
	if (!node)
		return NULL;
	if ((*isEql)(node->data,data))
		return node;
	LinearLinkedListNode* prog = node->nextsChildsManager;
	while (prog)
	{
		FindNodeGeneralTreeNode(prog->data,data,(*isEql));
		prog = prog->next;
	}
}