walk.c
1.55 KB
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
/**
* \file
*
* \author Georg Hopp
*
* \copyright
* Copyright © 2014 Georg Hopp
*
* 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 3 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, see <http://www.gnu.org/licenses/>.
*/
#include "tr/tree.h"
unsigned long
TR_treeWalk(TR_Tree this, const void * data, TR_TreeAction action)
{
TR_TreeNode previous;
TR_TreeNode node;
int depth = 1;
unsigned long processed = 0;
previous = this->root;
node = this->root;
while (NULL != node) {
if (previous == TR_TREE_RIGHT(node)) {
previous = node;
node = node->parent;
depth--;
continue;
}
if (NULL == TR_TREE_LEFT(node) || previous == TR_TREE_LEFT(node)) {
if (action) {
action(node->data, data, depth);
processed++;
}
previous = node;
if (NULL != TR_TREE_RIGHT(node)) {
node = TR_TREE_RIGHT(node);
depth++;
} else {
node = TR_TREE_PARENT(node);
depth--;
}
} else {
previous = node;
node = TR_TREE_LEFT(node);
depth++;
}
}
return processed;
}
// vim: set ts=4 sw=4: