CPP Linked List - Merge two sorted Linked Lists

#1

what is the error in my merge funcion

CPP Linked List - Merge two sorted Linked Lists

#2

@ayush1213 hey ayush share your code through ide.codingblocks.com

#3

@jaiskid https://ide.codingblocks.com/s/132688

#4

@ayush1213 hey ayush your logic is seem wrong make a recursive function for merge this
node * merge(node * a ,node * b ){
if(a==NULL){
return b;
}
else if(b==NULL){
return a;

}
node * c;
if(a->data<=b->data){
	c=a;
	c->next=merge(a->next,b);
}
else{
	c=b;
	c->next=merge(a,b->next);
}
return c;

}

#5

@jaiskid sir i writed down recursiv e but i want to try iterative approach can u tell the error in my code where i m doing mistake