This is a linked list node class Node { public: int data; Node *next; }; Using the above code write the following functions. Please test in the main function of your program. Please upload all code that you write. 1. Adding and removing a node 2. Removing ever third node 3. Adding the complete list at the end. if you had a list 1,2,3 the new list will be 1,2,3,1,2,3
This is a linked list node
class Node
{
public:
int data;
Node *next;
};
Using the above code write the following functions. Please test in the main function of your program. Please upload all code that you write.
1. Adding and removing a node
2. Removing ever third node
3. Adding the complete list at the end. if you had a list 1,2,3 the new list will be 1,2,3,1,2,3
4. Write a function to find the average of the list
5. Write a function that takes in a list as a parameter and adds it to the current list. This Node add will only happen if list 1 element is less then list 2 element.
Example
List 1 - 1,2,3
List 2 - 3,1,4
New List - 4,2,7 - It only adds if L2 > L1
List all assumptions.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
