blob: fd53d09468e97750aa876d370f20d505ed45c5ab (
plain)
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
|
/* Copyright (C) 2009 Luke Shumaker
This file is part of rvs.
rvs 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, or (at your
option) any later version.
rvs 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 rvs; see the file COPYING.
If not, write to the Free Software Foundation,
59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#ifndef FILE_structures_h_SEEN
#define FILE_structures_h_SEEN
#include "string.h"
/*----------------------------structures----------------------------*/
/* a generic binary tree emulating a n-ary tree via linked list */
struct tree_list
{
void *node;
struct tree_list *child;/* left leaf */
struct tree_list *next; /* right leaf */
};
/* a generic binary tree */
struct tree_node
{
void *node;
struct tree_node *left;
struct tree_node *right;
};
/*----------------------------functions-----------------------------*/
/* find a node with `name'. in the current layer of tree_list */
struct tree_list *
ds_tree_list_find (struct tree_list *node, char *name)
{
if (strcmp(node->node,name) == 0)
return node;
else {
if (node->next==NULL)
return NULL;
else
return ds_tree_list_find(node->next,name);
}
}
#endif
|
