Queue Class Reference

Collaboration diagram for Queue:

Public Member Functions
void	enqueue (int val)
void	dequeue ()
void	traverse ()

Public Attributes
node *	t [100]
int	front
int	rear

Private Member Functions
	Queue (const Queue &)=delete
Queue &	operator= (const Queue &)=delete
void	createNode (int val)

Private Attributes
node *	front = nullptr
node *	rear = nullptr

Detailed Description

Definition at line 17 of file binary_search_tree.cpp.

Constructor & Destructor Documentation

~Queue()

Queue::~Queue ( )

inline

Definition at line 16 of file circular_queue_using_linked_list.cpp.

             {
        while (front) {
            dequeue();
        }
    }

Member Function Documentation

createNode()

void Queue::createNode ( int val )

inlineprivate

Definition at line 23 of file circular_queue_using_linked_list.cpp.

                             {
        auto* nn = new node;
        nn->data = val;
        nn->next = nullptr;
        front = nn;
        rear = nn;
    }

dequeue()

void Queue::dequeue ( )

inline

Definition at line 43 of file circular_queue_using_linked_list.cpp.

                   {
        if (front == nullptr) {
            return;
        }
        const node* const n = front;
        if (front == rear) {
            front = nullptr;
            rear = nullptr;
        } else {
            front = front->next;
            rear->next = front;
        }
        delete n;
    }

enqueue()

void Queue::enqueue ( int val )

inline

Definition at line 32 of file circular_queue_using_linked_list.cpp.

                          {
        if (front == nullptr || rear == nullptr) {
            createNode(val);
        } else {
            node* nn = new node;
            nn->data = val;
            rear->next = nn;
            nn->next = front;
            rear = nn;
        }
    }

traverse()

void Queue::traverse ( )

inline

Definition at line 57 of file circular_queue_using_linked_list.cpp.

                    {
        if (front == nullptr) {
            return;
        }
        const node* ptr = front;
        do {
            std::cout << ptr->data << ' ';
            ptr = ptr->next;
        } while (ptr != front);
        std::cout << '\n';
    }

Member Data Documentation

front [1/2]

int Queue::front

Definition at line 19 of file binary_search_tree.cpp.

front [2/2]

node* Queue::front = nullptr

private

Definition at line 8 of file circular_queue_using_linked_list.cpp.

rear [1/2]

int Queue::rear

Definition at line 20 of file binary_search_tree.cpp.

rear [2/2]

node* Queue::rear = nullptr

private

Definition at line 9 of file circular_queue_using_linked_list.cpp.

t

node* Queue::t[100]

Definition at line 18 of file binary_search_tree.cpp.

---

The documentation for this class was generated from the following files:

• data_structures/binary_search_tree.cpp
• data_structures/circular_queue_using_linked_list.cpp