Example Code
Example Code
#include<iostream>
struct nod {
int d;
nod *n;
int c = 0;
void createnode(int n) {
np = new nod;
np->d = n;
np->n = NULL;
if (c == 0) {
head = np;
p = head;
p->n = head;
c++;
} else if (c == 1) {
p = head;
q = p;
np->n = p;
head = np;
p->n = np;
p->n = np;
np->n = head;
c++;
} else {
p = head;
q = p;
np->n = p;
head = np;
do {
p = p->n;
p->n = head;
q = p;
p = p->n;
if (p->n == head) {
p->n = np;
np->n = head;
q->n = np;
np->n = p;
break;
void display(int i) {
nod *t = head;
int c = 0;
while (c <= i ) {
cout<<t->d<<"\t";
t = t->n;
c++;
int main() {
int i = 0, n, a;
cin>>n;
while (i < n) {
cin>>a;
createnode(a);
i++;
display(n);
Output
enter the no of nodes
5
enter value of node
6
enter value of node
4
enter value of node
7
enter value of node
3
enter value of node
2
sorted singly link list
2 3 4 6 7 2