1 /*
2  * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
3  * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
4  *
5  * Permission is hereby granted, free of charge, to any person obtaining a
6  * copy of this software and associated documentation files (the "Software"),
7  * to deal in the Software without restriction, including without limitation
8  * the rights to use, copy, modify, merge, publish, distribute, sublicense,
9  * and/or sell copies of the Software, and to permit persons to whom the
10  * Software is furnished to do so, subject to the following conditions:
11  *
12  * The above copyright notice including the dates of first publication and
13  * either this permission notice or a reference to
14  * http://oss.sgi.com/projects/FreeB/
15  * shall be included in all copies or substantial portions of the Software.
16  *
17  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
18  * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20  * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
21  * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
22  * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
23  * SOFTWARE.
24  *
25  * Except as contained in this notice, the name of Silicon Graphics, Inc.
26  * shall not be used in advertising or otherwise to promote the sale, use or
27  * other dealings in this Software without prior written authorization from
28  * Silicon Graphics, Inc.
29  */
30 /*
31 */
32 
33 #ifndef _SEARCHTREE_H
34 #define _SEARCHTREE_H
35 
36 typedef struct treeNode{
37   void *key;
38   struct treeNode* parent;
39   struct treeNode* left; /*children*/
40   struct treeNode* right;
41 } treeNode;
42 
43 treeNode* TreeNodeMake(void *key);
44 void TreeNodeDeleteSingleNode(treeNode* node);
45 void TreeNodeDeleteWholeTree(treeNode* node);
46 void TreeNodePrint(treeNode* node,
47 		   void (*keyPrint) (void*));
48 int TreeNodeDepth(treeNode* root);
49 treeNode* TreeNodeMinimum(treeNode* node);
50 treeNode* TreeNodeMaximum(treeNode* node);
51 treeNode* TreeNodePredecessor(treeNode* node);
52 treeNode* TreeNodeSuccessor(treeNode* node);
53 treeNode* TreeNodeFind(treeNode* tree, void* key,
54 		       int (*compkey) (void*, void*));
55 
56 treeNode* TreeNodeInsert(treeNode* root, treeNode* newnode,
57 		    int (*comp) (void *, void *));
58 treeNode* TreeNodeDeleteSingleNode(treeNode* tree, treeNode* node);
59 
60 
61 #endif
62