2 ** License Applicability. Except to the extent portions of this file are
3 ** made subject to an alternative license as permitted in the SGI Free
4 ** Software License B, Version 1.1 (the "License"), the contents of this
5 ** file are subject only to the provisions of the License. You may not use
6 ** this file except in compliance with the License. You may obtain a copy
7 ** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
8 ** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
10 ** http://oss.sgi.com/projects/FreeB
12 ** Note that, as provided in the License, the Software is distributed on an
13 ** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
14 ** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
15 ** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
16 ** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
18 ** Original Code. The Original Code is: OpenGL Sample Implementation,
19 ** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
20 ** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
21 ** Copyright in any portions created by third parties is as indicated
22 ** elsewhere herein. All Rights Reserved.
24 ** Additional Notice Provisions: The application programming interfaces
25 ** established by SGI in conjunction with the Original Code are The
26 ** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
27 ** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
28 ** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
29 ** Window System(R) (Version 1.3), released October 19, 1998. This software
30 ** was created using the OpenGL(R) version 1.2.1 Sample Implementation
31 ** published by SGI, but has not been independently verified as being
32 ** compliant with the OpenGL(R) version 1.2.1 Specification.
41 typedef struct treeNode
{
43 struct treeNode
* parent
;
44 struct treeNode
* left
; /*children*/
45 struct treeNode
* right
;
48 treeNode
* TreeNodeMake(void *key
);
49 void TreeNodeDeleteSingleNode(treeNode
* node
);
50 void TreeNodeDeleteWholeTree(treeNode
* node
);
51 void TreeNodePrint(treeNode
* node
,
52 void (*keyPrint
) (void*));
53 int TreeNodeDepth(treeNode
* root
);
54 treeNode
* TreeNodeMinimum(treeNode
* node
);
55 treeNode
* TreeNodeMaximum(treeNode
* node
);
56 treeNode
* TreeNodePredecessor(treeNode
* node
);
57 treeNode
* TreeNodeSuccessor(treeNode
* node
);
58 treeNode
* TreeNodeFind(treeNode
* tree
, void* key
,
59 int (*compkey
) (void*, void*));
61 treeNode
* TreeNodeInsert(treeNode
* root
, treeNode
* newnode
,
62 int (*comp
) (void *, void *));
63 treeNode
* TreeNodeDeleteSingleNode(treeNode
* tree
, treeNode
* node
);