
数据结构
文章平均质量分 65
隔壁萌萌的陈大爷
To Be A Programmer
展开
-
二叉树操作
#include #include #include typedef char ElemType; typedef struct Node{ ElemType data; struct Node *lchild; struct Node *rchild; }Node; int count; void Manu(); //菜单 Node原创 2014-04-08 20:21:28 · 886 阅读 · 0 评论 -
对递归执行过程的简单描述
#include void fun(int n) { printf("1th - Level: %d Address: %d\n", n, &n); if(n < 3) fun(n+1); printf("2th - Level: %d Address: %d\n", n, &n); } int main() { fun(1); r原创 2015-12-01 18:27:27 · 4878 阅读 · 2 评论