c树结构删除问题

2011-12-14 12:35:04 264 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

AD9361 RSSI配置实战：从寄存器到精准功率测量的避坑指南本文详细解析了AD9361芯片的RSSI配置实战，从寄存器设置到精准功率测量的全流程避坑指南。通过优化模式选择、测量持续时间及高级参数配置，实现高精度信号强度测量，并分享实际项目中的校准流程与性能优化技巧，帮助工程师提升射频接收链路的测量精度。阅读详情



#include <stdio.h>

#include <unistd.h>

#include <stdlib.h>

#include <string.h>



const char* playlist[256] = {"111","222","333","44"};





typedef struct node

{

	char name[256];

	int playtype;

	int ucValid;		

	int sonsize;

	struct node* son[12];

	struct node* parent;

};



struct node* create(struct node* item)

{

	item = (struct node*)malloc(sizeof(struct node));

	memset(item,0,sizeof(struct node));

	return item;

}





struct node* p_node;

static int num=0;

//删除一个节点

void delete(struct node* item)

{

	int i;

	//struct node* tmp;

	//tmp = create(tmp);

	//sprintf(tmp->name,"p_node%d",num++);

	//p_node = tmp;

	//tmp = item;

	for(i=0;i<item->sonsize;i++)

	{

		delete(item->son[i]);

	}

	

	free(item);

	item= NULL;

}



void displaynode(struct node* item)

{

	printf("============display node info=========\n");

	printf("node name : %s\nnode parent :%d\nnode sonsize :%d\n",

			item->name,item->parent,item->sonsize);

}



void displaytree(struct node* item)

{

	int i;

	if(item == NULL)

	{

		return;

	}

	for(i=0;i<item->sonsize;i++)

	{

		if(item->son[i] == NULL)

			continue;

		printf("--%s addr:0x%x\n",item->son[i]->name,item->son[i]);

		if(item->son[i]->sonsize > 0)

		{

			printf("subnode\n");

			displaytree(item->son[i]);

			printf("endofsubnode\n");

		}

	}

}



void move(struct node* parent,struct node* item)

{

	int i;

	int tmp;

	tmp = 0;

	parent->son[parent->sonsize++] = item;

	item->parent = parent;

	

	//更新parent的ucValid信息

	for(i=0;i<parent->sonsize;i++)

	{

		tmp |= parent->son[i]->ucValid;

	}

	parent->ucValid = tmp;

}



struct node* buildtree(struct node* root)

{

	int i;

	struct node* item;

	

	if(root == NULL)

	{

		printf("error! root is null\n");

	}

	

	//创建一级菜单

	for(i=0;i<4;i++)

	{

		item = create(item);

		//给name赋值

		strcpy(item->name,playlist[i]);

		move(root,item);

	}

	

	return root;

}



void buildtreeitem(struct node* root)

{

	int i;

	struct node* item;



	//测试代码

	for(i=0;i<7;i++)

	{

		item = create(item);

		sprintf(item->name,"item%d",i);

		item->playtype = i;

		item->ucValid = i%2;

		move(root->son[0],item);

	}

}







int main(int argc,char** argv)

{

	printf("sizeof node :%d\n",sizeof(struct node));

	struct node* root;

	root = NULL;

	root = create(root);

	strcat(root->name,"root");

	buildtree(root);

	buildtreeitem(root);

	displaynode(root);

	displaytree(root);



	//释放

	delete(root);

	printf("root name :%s\n",root->name);

	displaytree(root);

	return 0;

}

代码如上,删除函数delete只能删掉第一个节点和第一个子节点,但是如果改成
void delete(struct node* item)
{
int i;
struct node* tmp;
tmp = create(tmp);
//sprintf(tmp->name,"p_node%d",num++);
//p_node = tmp;
tmp = item;
for(i=0;i<tmp->sonsize;i++)
{
delete(tmp->son[i]);
}

free(tmp);
tmp= NULL;
}
貌似就可以删除,但是root节点还是能打印出信息来不是NULL
另外直接free(root)好像也只free掉了name
请问究竟该怎么写删除代码? 为什么直接free不掉?

...全文