aatree.h
来自「数据结构与算法分析(C语言描述)的源代码 里面的代码的质量非常高」· C头文件 代码 · 共 27 行
H
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 */
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?