FazBrowse GitHub Viewer | Trending | | Home

Tools: [Download Repo ZIP] [View Raw Code] [Original HTTPS Page]

Data-structure/singly_linked_list.cpp at master · Bhanups123/Data-structure · GitHub

92 lines (92 loc) · 1.76 KB

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

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

#include<malloc.h>

#include<iostream>

using namespace std;

struct node{

int data;

node* next;

};

node* insert_begin(node * head, int data){

node* new_node = (node *)malloc(sizeof(node));

new_node->data= data;

new_node->next= head;

return new_node;

}

node* insert_n(node* head, int data, int n){

node* cur = head;

node* new_node = (node*)malloc(sizeof(node));

new_node->data = data;

if(n==0){

head = insert_begin(head, data);

}

else if(n>0){

while(n-1!=0){

cur=cur->next;

n--;

}

new_node->next=cur->next;

cur->next = new_node;

}

return head;

}

void print_list(node* head){

while(head!=NULL){

cout<<head->data<<"->";

head = head-> next;

}

cout<<"NULL"<<endl;

}

node * reverse_list(node* head){

node *cur, *prev, *cur_next;

prev = NULL;

cur = head;

cur_next = head->next;

while(cur!=NULL){

cur_next = cur->next;

cur->next= prev;

prev = cur;

cur = cur_next;

//instead of line 45 if(cur!=NULL)

// cur_next = cur->next;

}

return prev;

}

void forward_print(node* head){

cout<<head->data<<" ";

if(head->next!=NULL)

forward_print(head->next);

else

cout<<endl;

}

void reverse_print(node* head){

if(head==NULL){

return;

}

reverse_print(head->next);

cout<<head->data<<" ";

}

node* reverse_list_rec(node* prev, node* head){

if(head == NULL){

return prev;

}

node* pointer;

pointer = reverse_list_rec(head, head->next);

head->next = prev;

return pointer;

}

int main(){

node* head= NULL;

head = insert_begin(head, 4);

head = insert_begin(head, 3);

head = insert_begin(head, 2);

head = insert_begin(head, 1);

head = insert_n(head, 5, 4);

print_list(head);

head = reverse_list(head);

print_list(head);

forward_print(head);

reverse_print(head);

cout<<endl;

head = reverse_list_rec(NULL, head);

print_list(head);

return 0;

}

Back | FazBrowse Home | New Git URL