This exercise is to build out a working linked list programbased on zyBooks Chapter 13 in C programming.
We are going to implement the following utility functions:
- IntNode* CreateNode(int dataInit, IntNode* nextLoc)
- void PrintNodeData(IntNode* thisNode)
- IntNode* FindNode(int searchData, IntNode* startingNode)
- void InsertNodeAfter(int dataInit, IntNode* thisNode)
and these operations:
- Insert x at the end of list
- Insert x at the head of list
- Insert y after item x in the list
- Insert y before item x in the list
- Replace item x with y in the list
- Find & Remove the item x from the list
- Search the list for item x
- Clear the list
- List Empty?
- List full?
- Current List Size
- Print current list contents
Starter Code:
#include <stdio.h>
#include <stdlib.h>
typedef
OR
OR