DataStructure

Date: 2025-03-01

Reproducer: XLY23333

Language: C

Code Platform: Visual Studio Code

OS: Debian GNU/Linux 12 (2C2G)

Compiler: gcc (Debian 12.2.0-14) 12.2.0

The code is not a 100% reproduction; some personal ideas have been incorporated. If there is any infringement, please contact Email: xly@xly23333.xyz for removal.

Contents

Unit2_LinearList

1. SqList.c

typedef struct {
    ElemType *data;
    int length;
    int maxsize;
} SqList;

2. HeadList.c

typedef struct Node{
    ElemType data;
    struct Node *next;
} Node;

typedef struct {  
    Node *head;
    int length;
} HeadList;

Unit3_StackQueue

1. Stack.c

typedef struct Stack {
    int top;
    int maxsize;
    ElemType *data;
} Stack;

2. Queue.c

typedef struct {
    ElemType *data;
    int front;
    int rear;
    int maxsize;
} Queue;

3. CalB

   • Stack.h
   • Stack.c
   • CalB.c
   • build.sh

4. Recursive.c

Unit4_Arr

1. TripleArray.c

typedef struct TripleArray{
    int m1;
    int m2;
    int m3;
    ElemType *array;
} TripleArray;

Unit5_Tree

1. BtTree.c

typedef struct btnode {
    ElemType data;
    struct btnode *left_c;
    struct btnode *right_c;
} BTNode;

typedef struct {
    BTNode *root;
} BinaryTree;

2. LeverOrder

   • Queue.h
   • BtTree.h
   • Queue.c
   • BtTree.c
   • LevelOrder.c
   • build.sh

3. Application

   Calculating the number of nodes in a binary tree Clearing a binary tree Building a binary tree in pre-order by str

   • BtTree.h
   • BtTree.c
   • app.c
   • build.sh

4. NonTraversalApplication

   InOrder traversal of a binary tree without recursion

   • Stack.h
   • Stack.c
   • BtTree.h
   • BtTree.c
   • ntapp.c
   • build.sh