u010144189的专栏

hash.h #ifndef _Hash_H #define ElementType int struct HashTal; struct ListNode; typedef struct HashTal * HashTable; typedef struct ListNode * Position; typedef Position List; HashTable initializeTa

栈的数组实现： stack.h #ifndef _Stack_h #define ElementType int struct StackRecord; typedef struct StackRecord *Stack; int IsEmpty( Stack S ); int IsFull( Stack S ); Stack CreatStack( int MaxElements

循环队列 Queue.h #ifndef _Queue_H #define ElementType int struct Queue; typedef struct Queue *QUEUE; void initQueue( QUEUE queue); int IsEmpty( QUEUE queue ); int IsFull( QUEUE queue ); void enQueue( E

单链表操作代码： list.h #ifndef _List_H #define ElementType int struct node; typedef struct node * PtrToNode; typedef PtrToNode List; typedef PtrToNode Position; List MakeEmpty( List L ); void CreatList

本文使用C语言编写了二叉树的基本实现代码。代码如下： #include #include #include struct node { char data; struct node *lchild; struct node *rchild; }; typedef struct node Node; typedef struct node *NodePtr;