Question: C++ Program: How to Merge Two Linked List into one The Method Signature is: Node merge(const Node &list) It should return *this and *this should
C++ Program: How to Merge Two Linked List into one
The Method Signature is: Node merge(const Node &list) It should return *this and *this should contain all the elements.
The Node class is as follows
class Node{
int data;
Node next;
}*ptr
public Node()
{
ptr head = nullptr;
}
What I have
Node merge(const Node &list)
{
if(list.head == nullptr)
{
return *this;
}
return *this
}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
