aboutsummaryrefslogtreecommitdiffstats
path: root/src/tree.c
blob: 74dcb48d969267b43aa1030f475a71304a720ce6 (plain) (blame)
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
/* the Music Player Daemon (MPD)
 * (c)2003-2006 by Warren Dukes (warren.dukes@gmail.com)
 * This project's homepage is: http://www.musicpd.org
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

#include "tree.h"

static inline TreeNode * newTreeNode() {
	TreeNode * ret = malloc(sizeof(TreeNode));

	ret->data[0] = NULL;
	ret->data[1] = NULL;

	ret->children[0] = NULL;
	ret->children[1] = NULL;
	ret->children[2] = NULL;

	return ret;
}

static inline void freeTreeNode(TreeNode * node) {
	free(node);
}

Tree * newTree(TreeFreeDataFunc * freeFunc, TreeCompareDataFunc * compareFunc) {
	Tree * ret = malloc(sizeof(Tree));

	ret->headNode = NULL;
	ret->freeFunc = freeFunc;
	ret->compareFunc = compareFunc;

	return ret;
}

void freeTree(Tree * tree) {
	TreeIterator * iter = newTreeIterator(tree, POSTORDER);

	TreeNode * node;

	if(data->freeFunc) {
		void * data;

		while( ( data = nextTreeIterator(iter) ) ) {

		}
	
		freeTreeIterator(iter);

		iter = newTreeIterator(tree, POSTORDER);
	}

	while( ( node = nextNodeTreeIterator(iter) ) ) {
		freeTreeNode(node);
	}

	freeTreeIterator(iter);
}