Hi -
I'm just trying to create a cery simple function to create a linked list of a given amount of nodes. If that makes sense.
So the number of required nodes is passed to the function
The function then allocates enough memory for the linked list
The list is passed back from whence it was called from.
I have already attempted this but have come a cropper so just need a fresh perspective on it if anyone has one?
Thanks for any help
Helen
I wouldn't recomend allocating all of the list's memory in one chunk, each node should have it's memory allocated seperatly so that you can remove nodes properly.Originally Posted by thedoofus
First you would create the root Node then too add a node to the list you would allocate memory the size of one node and save the pointer to that node in the root node's Next Pointer. Then move to the next node using the next pointer and allocate the next node and so on...
You can do this in one function. It's really easy:
Quzah.Code:List *makelist( datatype array[], int size ) { for x = 0; x < size; x ++ allocate one node fill this node with array element x's data link this node to a list return the first element in the list }
Hope is the first step on the road to disappointment.
