语言结构体指针初始化.docVIP

代码如卜* #include ^include ^include 4. struct student{ char 氺name; int score; struct student氺 next; } stu, *stul; 10. int main 0 { stu. name = (char*)malloc (sizeof (char)) ; /*1.结构体成员指针需 要初始化吟 strepy (stu. name, /zJimy〃)； stu.score = 99; 15. stul = (struct student*)malloc(sizeof(struct student));/本2?结 构体指针需要初始化*/ stul-name = (char*)malloc(sizeof (char)) ;/*3.结构体指针的成员 指针同样需要初始化*/ stu. next = stul; strepy (stu卜〉name，Lucy); stul-〉score = 98; stul-next = NULL; printf (name %s, score %d \n 〃，stu. name, stu.score); printf(〃name %s, score %d \n 〃，stul-〉name，stul-score); free (stul); return 0; } ^include ^include ftinclude struct student { char 本name; int score; struct student* next; }stu,本stul; int main() { stu. name = (char*)malloc (sizeof (char)) ; /*1.结构体成员指针需要初始化 */ strcpy (stu. name, /zJimy/z); stu.score = 99; stul = (struct student*)malloc(sizeof(struct student)) ;/*2.结构体指针需要初始化*/ stul-name = (char*)mal loc(sizeof (char)) ; A3.结构体指针的成员指针同样需要初始化*/ stu.next = stul; strcpy (stul-name, Lucy); stul-score = 98; stul-next = NULL; printf (z，name %s, score %d \n ，z, stu. name, stu. score); printf (z/name %s, score %d \n 〃，stul-name，stul-scorc); free (stul); return 0; } 写测试代码的过程屮我明白了，同事所说的二义树遍历算法屮所用的左子树和A 了树指针不需要初始化，其实是这样的，左了树和右了树指向的必须是二叉树 节点类型的结构体指针（你填?一个长度相M的指针也可以），而该结构体指针是 需要初始化的（见 2）,也就是并没有通过malloc來分配内存，而是将另 一个指针的值赋给它 顿时觉得挺无语的，确实，看了很多大学里的教材，对于二叉树的遍历等算法定 义的结构体无非是以下形式 struct node{ int data; struct node氺 lchild， rchild; struct node { int data; struct node* lchild， rchild; }; 使用时都直接的 struct node氺 root; root = (struct node*)malloc(sizeof(struct node)); root-data = 3; 4. struct node氺 nlchild; nlchild = (struct node*)malloc(sizeof(struct node)); root-lchild = nlchild; nlchild-data = 2; 9. struct node氺 nrchild; nlrchild = (struct node*)malloc(sizeof(struct node)); root-rchild = nrchild; nrchild-〉data = 4; struct node氺 root; root = (struct node*)malloc(sizeof(struct node)); root-data = 3; struct node氺 nlchild; nlchild = (struct node*)malloc(sizeof(struct node)); root-lchild = nlchild