-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathtree.h
37 lines (29 loc) · 838 Bytes
/
tree.h
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
/* Based on Data Structures and Algorithm Analysis in C (Second Edition)
* by Mark Allen Weiss.
*
* Modified by Minlan Yu.
*/
#ifndef _TREE_H_
#define _TREE_H_
#include "binheap.h"
struct tree_element {
sequence_number_t l1num;
PriorityQueue queue;
};
typedef struct tree_element TreeElementType;
struct TreeNode;
typedef struct TreeNode *Position;
typedef struct TreeNode *SearchTree;
struct TreeNode {
TreeElementType Element;
SearchTree Left;
SearchTree Right;
};
SearchTree TreeMakeEmpty( SearchTree T );
Position TreeFind( int value, SearchTree T );
Position TreeFindMin( SearchTree T );
Position TreeFindMax( SearchTree T );
SearchTree TreeInsert( TreeElementType X, SearchTree T );
SearchTree TreeDelete( TreeElementType X, SearchTree T );
TreeElementType TreeRetrieve( Position P );
#endif /* _TREE_H_ */