C tree

#include <dos.h>
#include <stdio.h>
#include <malloc.h>
#include <string.h>
#include<stdlib.h>

typedef struct NODE
{
	int id;
	char name[10];
	struct NODE *NextNode;
}Node;

Node *NodeInit()
{
	Node *pNode ;
	pNode = (Node *)malloc(sizeof(struct NODE));
	if(pNode == NULL)
	{
		exit( -1);
	}
	Node *p = pNode;
	p->NextNode= NULL;
	for(int i=0;i<10;i++)
	{
		p->id = i +1;
		char temp[10]="";
		sprintf(p->name,"liheng%d",i+1);
		Node *pNew;
		pNew = (Node *)malloc(sizeof(Node));
		p->NextNode = pNew;
		pNew->NextNode = NULL;
		p = pNew;
	}
	return pNode;
}
int getNodeLength(Node *pNode)
{
	int i = 0;
	while(pNode->NextNode!=NULL)
	{
		i++;
		pNode = pNode->NextNode;
	}
	return i;
}

Node *getNameByNode(Node *pNode,char *name)
{
	Node *pTemp = pNode;
	int m = getNodeLength(pNode);
	for(int i=0;i<m ;i++)
	{
		if(strcmp(pTemp->name, name)==0)
		{
			return pTemp;
		}
		else
		{
			pTemp = pTemp->NextNode;
		}
	}
	return NULL;
}

int travelNode(Node *pNode)
{
	Node *p = pNode;
	int m = getNodeLength(pNode);
	printf("NUM		ID		NAME	 \n");
	for(int i=0;i<m; i++)
	{
		printf("%d		%d		%s	 \n",i,p->id, p->name);
		p = p->NextNode;
	}
	return 0;
}
int UpdateNode(Node *pNode,int num,int NodeId,char *NodeName)
{
	int m = getNodeLength(pNode);
	num = num -1;
	if(m<num)
	{
		return -1;
	}
	int i=0;
	while(i!=num)
	{
		pNode = pNode->NextNode;
		i++;
	}
	pNode->id = NodeId;
	strcpy(pNode->name,NodeName);
	return 0;
}

int DeleteNode(Node *pNode,int num)
{
	Node *p = pNode;
	int m = getNodeLength(pNode);
	if(m<num)
	{
		return -1;
	}
	int i =0;
	
	while(i!=num -2)
	{
		p = p->NextNode;
		i++;
	}
	p->NextNode = p->NextNode->NextNode;

	return 0;
}

int main()
{
	Node *myNode;
	myNode = NodeInit();
	
	
	travelNode(myNode);
	Node *pHeng5 = getNameByNode(myNode,"liheng5");
	if(pHeng5!=NULL)
	{
		printf("pHeng5->id = %d\n",pHeng5->id);
	}
	system("pause");


	UpdateNode(myNode,2,2,"lulu");
	printf("%d		%s\n",myNode->id,myNode->name);
	travelNode(myNode);	
	system("pause");

	DeleteNode(myNode,5);
	travelNode(myNode);
	system("pause");
	return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值