CPP
cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
//input = 1 2 3 4 5
#include <iostream>
using namespace std;
struct node{
int data;
struct node *next;
};
void insert(node *root,int n){
if(root->data==NULL){
root->data = n;
root->next = NULL;
}else{
while(root->next!=NULL){
root=root->next;
};
node *ptr = new node();
ptr->data = n;
ptr->next = NULL;
root->next = ptr;
};
};
void traverse(node *head){
while(head->next!=NULL){
cout<<head->data;
};
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run