algorithm_level_5/Test_clsMydblLinkedList.cpp at main · Kerolos08/algorithm_level_5 · 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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include <iostream>
#include "clsMydblLinkedList.h"

using namespace std;

int main()
{
    clsdblLinkedList<int> DLinkedList;

    if (DLinkedList.IsEmpty())
    {
        cout << "\nList is empty!\n";
    }
    else
    {
        cout << "\nList is not empty.\n";
    }

    // Adding nodes
    DLinkedList.InsertAtBeginning(5);
    DLinkedList.InsertAtBeginning(4);
    DLinkedList.InsertAtBeginning(3);
    DLinkedList.InsertAtBeginning(2);
    DLinkedList.InsertAtBeginning(1);

    // Printing list
    cout << "\nLinked list content: ";
    DLinkedList.PrintList();

    int searchvalue = 3;
    clsdblLinkedList<int>::Node *N1 = DLinkedList.Find(searchvalue);

    if (N1 != nullptr)
    {
        cout << "\nNode with value " << searchvalue << " is found.\n";
    }
    else
    {
        cout << "\nNode is not found!\n";
    }

    DLinkedList.InsertAfter(N1, 500);
    cout << "\nAfter inserting 500 after " << searchvalue << " :\n";
    DLinkedList.PrintList();

    DLinkedList.InsertAtEnd(600);
    cout << "\nAfter inserting 600 at the end" << " :\n";
    DLinkedList.PrintList();

    searchvalue = 4;
    clsdblLinkedList<int>::Node *N2 = DLinkedList.Find(searchvalue);
    DLinkedList.DeleteNode(N2);
    cout << "\nAfter deleting " << searchvalue << ":\n";
    DLinkedList.PrintList();

    DLinkedList.DeleteFirstNode();
    cout << "\nAfter delete first node :\n";
    DLinkedList.PrintList();

    DLinkedList.DeleteLastNode();
    cout << "\nAfter deleting last node :\n";
    DLinkedList.PrintList();

    cout << "\nNumber of items in the linked list = " << DLinkedList.Size() << endl;

    if (DLinkedList.IsEmpty())
    {
        cout << "\nList is empty!\n";
    }
    else
    {
        cout << "\nList is not empty.\n";
    }

    // cout << "\nExecuting .Clear \n";
    // DLinkedList.Clear();

    // cout << "\nNumber of items in the linked list = " << DLinkedList.Size() << endl;

    if (DLinkedList.IsEmpty())
    {
        cout << "\nList is empty!\n";
    }
    else
    {
        cout << "\nList is not empty.\n";
    }

    // Printing list
    cout << "\nLinked list content: ";
    DLinkedList.PrintList();

    DLinkedList.Reverse();
    cout << "\nLinked list content after being reversed: \n";
    DLinkedList.PrintList();

    clsdblLinkedList<int>::Node *N;
    N = DLinkedList.GetNode(2);

    cout << "\nNode value is: " << N->Value << "\n";

    cout << "\nItem (2) Value is: " << DLinkedList.GetItem(2) << endl;

    DLinkedList.UpdateItem(2, 600);
    cout << "\nList after update: ";
    DLinkedList.PrintList();

    DLinkedList.InsertAfter(1, 600);
    cout << "\nPrinting the list after inserting a new node after index 1: \n";
    DLinkedList.PrintList();

    return 0;
}