RETURN100ERRORS的博客

C语言实现二叉排序树并中序遍历验证#include<stdio.h>#include<stdlib.h>typedef struct BitNode{ int data; struct BitNode *lchild,*rchild;}BitNode;void Enternumber(int **k){ int i; *k=(int *)malloc(10*sizeof(int)); printf("请输入10个不相同整数 :"); for(i=0;

#include <time.h>void main(){ struct tm *p; time_t now; time(&now); p=localtime(&now); printf("%d/%d/%d %d:%d:%d",p->tm_year+1900,\ p->tm_mon+1,p->tm_mday,p->tm_hour,p->tm_min,p->tm_sec);}在标准C/C+.

欢迎大家交流指正#include<stdio.h>#include<stdlib.h>#define MAXSIZE_QUEUE 1000#define MAXSIZE_STACK 1000typedef char TElemType;typedef int Statistics;//树的结构体typedef struct BitNode { TElemType data; Statistics count; //非递归后续遍历使用,用于统计次数