DataStructures/AddNodesSorted.cpp at master · CharanTejaAllada/DataStructures · 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
 ListNode* AddNodesSorted(int val,ListNode *head)
    {

       if(head == NULL)
       {
           head = new ListNode(val);
           return head;
       }

        ListNode *tmp = head;
        ListNode *prev = head;

        while(tmp != NULL)
        {
            if(tmp->next == NULL)
            {
                if(tmp == head)
                {
                    if(val<=tmp->val)
                    {
                        ListNode *someNode = new ListNode(val);
                        someNode->next = head;
                        head = someNode;
                        return head;
                    }

                    else
                    {
                         ListNode *someNode = new ListNode(val);
                         head->next = someNode;
                         return head;
                    }
                }

                else
                {
                    if(val <= tmp->val)
                    {
                        ListNode *someNode = new ListNode(val);
                        someNode->next = tmp;
                        prev->next = someNode;
                        return head;
                    }

                    else
                    {
                        ListNode *someNode = new ListNode(val);
                        tmp->next = someNode;
                        return head;
                    }
                }
            }

            else if(val <= tmp->val)
            {
            ListNode *someNode = new ListNode(val);
            someNode->next = tmp;
            if(tmp == head)
            {
                head = someNode;
                return head;
            }
            prev->next = someNode;
            return head;
            }

            prev = tmp;
            tmp = tmp->next;
        }

        return head;
    }