Eevey的博客

利用栈实现二进制数转化成十进制数#include "stdio.h"#include "stdlib.h"#include "math.h"#define OK 1#define ERROR 0#define STACK_INIT_DATA 20#define STACKINCREMENT 10typedef char Elemtype;typedef int St...

创建并线索化一颗二叉树#include "stdio.h"#include "stdlib.h"typedef char Elemtype ;typedef enum{Link,Thread} PointerTag;typedef struct BiTNode{ Elemtype data; struct BiTNode *lchild; struct BiTNode *rchil...

用递归实现汉诺塔#include "stdio.h"void move(int n,char x,char y,char z){ if(n==1){ printf("%c->%c\n",x,z); } else{ move(n-1,x,z,y); printf("%c->%c\n",x,z); move(n-1,y,x,z); }}void main(...

利用递归实现斐波那契数列#include "stdio.h"int Fib(int i){ if(i<2) return i=0?0:1; else return Fib(i-2)+Fib(i-1);}int main(){ int i; printf("请输入要实现的递归次数："); scanf("%d",&i); printf("\n最后的结果为：%d...

利用栈实现中缀表达式转换成后缀表达式#include "stdio.h"#include "stdlib.h"#include "math.h"#define OK 1#define ERROR 0#define STACK_INIT_DATA 20#define STACKINCREMENT 10typedef char Elemtype;typedef i...

利用栈实现二进制数转化成八进制数#include “stdio.h”#include “stdlib.h”#include “math.h”#define OK 1#define ERROR 0#define STACK_INIT_DATA 20#define STACKINCREMENT 10typedef char Elemtype;typedef int Stat...

创建和遍历一颗普通的二叉树#include "stdio.h"#include "stdlib.h"typedef char Elemtype ;typedef struct BiTNode{ Elemtype data; struct BiTNode *lchild; struct BiTNode *rchild;}BiTNode,*BiTtree;//前序的方法创建一棵二叉树...