实验二-数据结构.docxVIP

课程名称数据结构主讲教师实验学时2实验名称栈与队列上课地点1号楼143实验目的意义栈的基本运算实验过程及结果栈的基本运算#include stdlib.h#include stdio.h#include iostream#define stacksize 5int popdata[5],i=0;struct cell{int data;};struct stack{struct cell *top;struct cell *bottom;};pop(struct stack *s){if(s-top!=s-bottom){popdata[i]=(s-top)-data;s-top--;printf(Pop data:%d,(s-top)-data);i++;}elseprintf(The stack is empty.);}push(struct stack *s,int b){if(s-top-s-bottom5){(s-top)-data=b;s-top++;printf(Push data:%d,(s-top-1)-data);}elseprintf(The stack is full.);}main(){int x;struct stack *s;s=(struct stack*)malloc(sizeof(struct stack));scanf(%d,x);while(x!=-1){if(x==0){s-bottom=(struct cell *)malloc(stacksize*sizeof(struct cell));s-top=s-bottom;}else if(x==1){push(s,x);}else if(x==2){pop(s);}else printf(the input data is only -1,0,1,2);scanf(%d,x);}}循环队列的基本运算#include stdlib.h#include stdio.h#include iostream#define qsize 5int qdata[5],i=0;struct cell{int data;};struct queue{struct cell *base;int front;int rear;};void Enqueue(struct queue *q,struct cell e){if((q-rear+1)%qsize==q-front){printf(Queue is full!\n);return;}q-base[q-rear]=e;q-rear=(q-rear+1)%qsize;}void Dequeue(struct queue *q,struct cell *e){if(q-front ==q-rear){printf(Queue is empty!\n);return;}*e=q-base[q-front];q-front=(q-front+1)%qsize;}main(){int x;struct queue *q;struct cell e;q=(struct queue *)malloc(sizeof(struct queue));scanf(%d,x);while(x!=-1){if(x==0){q-base=(struct cell *)malloc(qsize*sizeof(struct cell));q-front =q-rear=0;}else if(x==1){e.data=1;Enqueue(q,e);printf(Enter:%d\n,e.data);}else if(x==2){Dequeue(q,e);printf(Output:%d\n,e.data);}else printf(the input data is only -1,0,1,2);scanf(%d\n,x);}}课程名称数据结构主讲教师实验学时2实验名称二叉树上课地点1号楼143实验目的意义建立二叉树的二叉链表表示，遍历二叉树实验过程及结果#include stdlib.h#include stdio.h#include iostreamstruct btnode{char data;struct btnode *lchild,*rchild;};typedef struct btnodebitreptr;bitreptr *r;char ch; int m=0,k=0;int n1;bitreptr *creatbt(){bitreptr *r;scanf(%c,ch);if(ch!=.){r=(struct btnode*)malloc(sizeof(struct btnode));r-data=ch;r-lchil