225: Test post


#include <iostream>
using namespace std;
class Node
{
private:
    int value;
    Node *nextNode;
    Node *prevNode;

public:
    Node() { value = 0, nextNode = nullptr, prevNode = nullptr; }
    Node(int value) { this->value = value, nextNode = nullptr, prevNode = nullptr; }
    void setValue(int value) { this->value = value; }
    void setNextNode(Node *nextNode) { this->nextNode = nextNode; }
    void setPrevNode(Node *prevNode) { this->prevNode = prevNode; }
    int getValue() { return value; }
    Node *getNextNode() { return nextNode; }
    Node *getPrevNode() { return prevNode; }
};

class DoublyLinkedList
{
private:
    int size;
    Node *headNode;
    Node *currentNode;

public:
    DoublyLinkedList() { size = 0, headNode = nullptr, currentNode = nullptr; }

    void printLinkedList();

    void insertAtHead(int value);
    void insertAtTail(int value);
    void insertAfter(int after, int value);
    void insertTwoAfter(int after, int value1, int value2);
    void insertBefore(int before, int value);
    void insertTwoBefore(int before, int value1, int value2);

    void remove(int value);
};

void DoublyLinkedList::printLinkedList()
{
    if (headNode == nullptr)
    {
        cout << "List is empty" << endl;
        return;
    }

    currentNode = headNode;
    while (currentNode != nullptr)
    {
        if (currentNode->getNextNode() != nullptr)
        {
            cout << currentNode->getValue() << " -> ";
        }
        else
        {
            cout << currentNode->getValue() << endl;
        }

        currentNode = currentNode->getNextNode();
    }

    currentNode = currentNode->getPrevNode();
    cout << "hello" << endl;
    while (currentNode != nullptr)
    {
        if (currentNode->getPrevNode() != nullptr)
        {
            cout << currentNode->getValue() << " <- ";
        }
        else
        {
            cout << currentNode->getValue() << endl;
        }

        currentNode = currentNode->getPrevNode();
    }
}

void DoublyLinkedList::insertAtHead(int value)
{
    Node *newNode = new Node(value);
    if (headNode == nullptr)
    {
        headNode = newNode;
    }
    else
    {
        newNode->setNextNode(headNode);
        headNode->setPrevNode(newNode);
        headNode = newNode;
    }
    size++;
    cout << value << " successfully added at head" << endl;
}

void DoublyLinkedList::insertAtTail(int value)
{
}
void DoublyLinkedList::insertAfter(int after, int value) {}
void DoublyLinkedList::insertTwoAfter(int after, int value1, int value2) {}
void DoublyLinkedList::insertBefore(int before, int value) {}
void DoublyLinkedList::insertTwoBefore(int before, int value1, int value2) {}

void DoublyLinkedList::remove(int value) {}

int main()
{
    DoublyLinkedList List;
    List.insertAtHead(5);
    List.insertAtHead(4);
    List.insertAtHead(3);
    List.insertAtHead(2);
    List.insertAtHead(1);

    List.printLinkedList();

    return 0;
}

 

Comments

Post a Comment

Popular posts from this blog

88: Using switch statement Write a C program to input marks of five subjects Physics, Chemistry, Biology, Mathematics and Computer. Calculate percentage and grade according to following: // Percentage >= 90% : Grade A Percentage >= 80% : Grade B Percentage >= 70% : Grade C Percentage >= 60% : Grade D Percentage >= 40% : Grade E Percentage < 40% : Grade F

  // Using switch statement Write a C program to input marks of five subjects Physics, Chemistry, Biology, Mathematics and Computer. //     Calculate percentage and grade according to following: //     Percentage >= 90% : Grade A //     Percentage >= 80% : Grade B //     Percentage >= 70% : Grade C //     Percentage >= 60% : Grade D //     Percentage >= 40% : Grade E //     Percentage < 40% : Grade F #include < iostream > using namespace std ; int main () {     float phy_g , phy_t , chem_g , chem_t , bio_g , bio_t , math_g , math_t , comp_g , comp_t , per ;     cout << " Enter your Physics marks: " ;     cin >> phy_g ;     cout << " Out of: " ;     cin >> phy_t ;     cout << " Enter your Chemistry marks: " ;     cin >> chem_g ;     cout << " Out of...
Read more

205: Book Catalog: Define a struct to represent a book with attributes like title, author, and publication year. Write a program to create a catalog of books by taking user input and display books published after a certain year.

  // Book Catalog: Define a struct to represent a book with attributes like title, author, and publication year. // Write a program to create a catalog of books by taking user input and display books published after a certain year. #include < iostream > using namespace std ; struct Books {     string title , author ;     int year ; }; Books new_book (); void print_book ( int i , Books x []); int main () {     int num ;     cout << " Enter the total number of books: " ;     cin >> num ;     // const int total = num;     Books book [ num ];     for ( int i = 0 ; i < num ; i ++)     {         book [ i ] = new_book ();     }     system ( " cls " );     int year ;     cout << " Enter the year: " ;     cin >> year ;     cout << " \n Every book published ...
Read more

15: Take input of age and name of 3 people by user and determine oldest and youngest among them with his age. -_-_-_-_-_-_-_-_-(line with spaces input concept)-_-_-_-_-_-_-_-_

  // Take input of age and name of 3 people by user and determine oldest and youngest among them with his age. #include < iostream > using namespace std ; int main () {     string person_1 , person_2 , person_3 ;     int age_1 , age_2 , age_3 ;     cout << " Enter the name of first person: " ;     getline ( cin >> ws , person_1 );     cout << " Enter his age: " ;     cin >> age_1 ;         cout << " \n Enter the the name of second person: " ;     getline ( cin >> ws , person_2 );     cout << " Enter his age: " ;     cin >> age_2 ;         cout << " \n Enter the name of third person: " ;     getline ( cin >> ws , person_3 );     cout << " Enter his age: " ;     cin >> age_3 ;     if ( age_1 > age_2 )   ...
Read more