aatree.h

来自「清华大学出版的数据结构（C语言版）中书中所提到的所有C源程序的实现。」· C头文件 代码 · 共 27 行

        #include <stdlib.h>
        #include "fatal.h"

        typedef int ElementType;

        #ifndef _AATree_H
        #define _AATree_H

        struct AANode;
        typedef struct AANode *Position;
        typedef struct AANode *AATree;

        AATree MakeEmpty( AATree T );
        Position Find( ElementType X, AATree T );
        Position FindMin( AATree T );
        Position FindMax( AATree T );
        AATree Initialize( void );
        AATree Insert( ElementType X, AATree T );
        AATree Remove( ElementType X, AATree T );
        ElementType Retrieve( Position P );

        extern Position NullNode;

        #endif  /* _AATree_H */

/* END */