Code-soln/middleofLinkedlist.cpp at master · prashanthkammar/Code-soln · GitHub

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
//Find middle element of a linked list

#include <iostream>

struct node
{
    int data;
    node *link;
} * p;

class Linkedlist
{
public:
    Linkedlist();
    void append(int num);
    void display();
    int middleelement();
    ~Linkedlist()
    {
        node *temp;
        while (p != NULL)
        {
            temp = p;
            p = p->link;
            delete temp;
        }
    }
};

Linkedlist::Linkedlist()
{
    p = NULL;
}

void Linkedlist::append(int num)
{
    node *r, *temp;
    r = new node;
    r->data = num;
    r->link = NULL;

    if (p == NULL)
        p = r;
    else
    {
        temp = p;
        while (temp->link != NULL)
            temp = temp->link;
        temp->link = r;
    }
}

int Linkedlist::middleelement()
{
    node *r, *q;
    r = q = p;
    while (q != NULL)
    {
        q = q->link;
        if (q != NULL)
            q = q->link;
        if (q != NULL)
            r = r->link;
    }
    int num = r->data;
    return num;
}

void Linkedlist::display()
{
    node *temp = p;
    while (temp != NULL)
    {
        std::cout << temp->data << " ";
        temp = temp->link;
    }
    std::cout << std::endl;
}

int main()
{
    Linkedlist l;
    l.append(50);
    l.append(30);
    l.append(40);
    l.append(10);
    l.append(20);
    l.append(5);
    l.append(1);
    l.display();
    std::cout << "Middle element is " << l.middleelement();
}