【数据结构基础（C语言实现）

struct Node
{
	int iValue;				//数据
	struct Node* pNext;		//下一个节点的地址
};

struct Node a = { 3,NULL },
			b = { 5,NULL },
			c = { 3,NULL },
			d = { 3,NULL };
	a.pNext = &b;
	b.pNext = &c;
	c.pNext = &d;

void Look(struct Node* pHead)
{
	while (pHead != NULL)
	{
		printf("%dn", pHead->iValue);
		pHead = pHead->pNext;			//指向下一个节点
	}
}

此时这个伪链表已经建立完成了，并且遍历出来，下来咱们进行其他操作

struct Node* FindByData(struct Node* pHead, int iData)
{
	while (pHead != NULL)
	{
		if (pHead->iValue == iData)
			return pHead;
		pHead = pHead->pNext;			//指向下一个节点
	}
	return NULL;
}

struct Node* FindByIndex(struct Node* pHead, int iIndex)
{
	// 0 开始表示下标 1 开始表示第几个
	int iNum = 1;
	while (pHead != NULL)
	{
		if (iNum == iIndex)
		{
			return pHead;
		}
		iNum++;
		pHead = pHead->pNext;			//指向下一个节点
	}
	return NULL;
}

void ShowData(struct Node* pNode)
{
	if (NULL == pNode)
	{
		printf("查无此节点n");
	}
	else
	{
		printf("查到节点： %dn", pNode->iValue);
	}
}

int Count(struct Node* pHead, int iData)
{
	int iCount = 0;
	while (pHead != NULL)
	{
		if (pHead->iValue == iData)
			iCount++;
		pHead = pHead->pNext;			//指向下一个节点
	}
	return iCount;
}

void ChangeByIndex(struct Node* pHead, int iIndex, int iData)
{
	struct Node* pTemp = FindByIndex(pHead, iIndex);
	if (pTemp != NULL)
	{
		pTemp->iValue = iData;
	}
}

void ChangeByData(struct Node* pHead, int iValue, int iData)
{
	struct Node* pTemp = FindByData(pHead, iValue);
	if (pTemp != NULL)
	{
		pTemp->iValue = iData;
	}
}

*此时呢，基本操作已经全部完成了。。。