queue11.cpp

queue11.cpp

Updated at June 15, 2023 10:14AM:

  - Included a check/conditional where there is no second highest element at all!

Go Back

// Link to challenge: https://www.w3resource.com/cpp-exercises/queue/index.php

#include <iostream>
#include <vector>

using namespace std;

class Queue{
    private:
            
        struct node{
            int data;
            node* next;
        };

        node* head = nullptr;

    public:

        Queue(){

        }

        Queue(std::vector<int> arr){
            enqueue(arr);
        }

        void enqueue(std::vector<int> arr){
            node* tmp = nullptr;
            node* current = nullptr;
            for (int i = 0; i < arr.size(); i++){
                if (head == nullptr){
                    head = new node{arr[i], nullptr};
                    current = head;
                }
                else {
                    tmp = new node{arr[i], nullptr};
                    current -> next = tmp;
                    current = current -> next;
                }
            }
        }

        void print(){
            cout << "Queue Elements: ";
            for (node* i = head; i != nullptr; i = i -> next){
                cout << i -> data << " ";
            }
            cout << endl;
        }

        int secondHighestElement(){
            int biggest = 0;
            int biggest2 = 0;
            bool isFound = false;
            for (node* i = head; i != nullptr; i = i -> next){
                if (i -> data > biggest){
                    biggest = i -> data;
                }
            }
            for (node* i = head; i != nullptr; i = i -> next){
                if (i -> data > biggest2 && i -> data < biggest){
                    biggest2 = i -> data;
                    isFound = true;
                }
            }
            if (!isFound){
                return 0;
            }
            return biggest2;
        }
};
int main(){
    Queue q1({3, 5, 2, 4, 10, 1, 20, 40, 31, 28, 50});
    q1.print();
    if (q1.secondHighestElement() == 0){
        cout << "No second highest element" << endl;
    }
    else {
        cout << q1.secondHighestElement() << endl;
    }
    Queue q2({1, 1, 1});
    q2.print();
    if (q2.secondHighestElement() == 0){
        cout << "No second highest element" << endl;
    }
    else {
        cout << q2.secondHighestElement() << endl;
    }
    return 0;
}

Console Output

Queue Elements: 3 5 2 4 10 1 20 40 31 28 50 
40
Queue Elements: 1 1 1
No second highest element

Go Back