Hi Friends,
Can you please help me write 3 functions in C++.
It's based on a 2 dimensional linked-list
The 3 functions that i have left to write are:
1.get_data: If data retrieval is successful return true otherwise return false.
2. update_data: This function updates the data located in the specified row and column of the linked list and above, returns true if data update is successful and returns false otherwise.
3. remove_data: This function removes a node located in the specified row and column from the linked list. If the node does not exist then return false other wise
remove the node and return true.
Attached is the project that i have managed to complete with the help of my tutor.
Can any one help me please, this will give me a bonus 5% in my course work.
Hi Friends,
Can you please help me write 3 functions in C++.
It's based on a 2 dimensional linked-list
The 3 functions that i have left to write are:
1.get_data: If data retrieval is successful return true otherwise return false.
2. update_data: This function updates the data located in the specified row and column of the linked list and above, returns true if data update is successful and returns false otherwise.
3. remove_data: This function removes a node located in the specified row and column from the linked list. If the node does not exist then return false other wise
remove the node and return true.
Attached is the project that i have managed to complete with the help of my tutor.
Can any one help me please, this will give me a bonus 5% in my course work.
Thank you.
Hi there,
Sorry, I don't understand your question. Could you please send me your updated program so I can have a look at it and hopefully come up with the best possible solution.
No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.
Unsolved 
