Нарисуйте блок-схему реализации метода Queue::Get. Объясните работу метода

#include "Queue.h"
#include <iostream>
using namespace std;
Queue::Queue(void)
{
 first = 0;
 last = 0;
 count = 0;
}
Queue::~Queue(void)
{
}
void Queue::Put(Element* e)
{
 if (e == 0)
 return;
 e->prev = last;
 
 if (count < 1)
 {
 last = e;
 first = e;
 }
 
 last->next = e;
 last = e;
 count++;
 cout << "Element " << e->value << "added to queue" << endl;
}
Element* Queue::Get()
{
 Element* e;
 
 if (first == 0)
 return 0;
 e = first;
 first = first->next;
 first->prev = 0;
 e->next = 0;
 count--;
 cout << "Element " << e->value << "removed from queue" << endl;
 return e;
}
void Queue::Print()
{
 if(count < 1)
 {
 cout << "Queue is empty";
 return;
 }
 
 Element* e;
 e = first;
 while(e != 0)
 {
 cout << e->value << ", ";
 e = e->next;
 }
 cout << endl;
}

#include "Element.h"
#include "Queue.h"
#include <conio.h>
void main ()
{
 Element e1, e2, e3, e4, e5;
 e1.value = 10;
 e2.value = 20;
 e3.value = 30;
 e4.value = 40;
 e5.value = 50;
 Queue q;
 q.Put(&e2);
 q.Put(&e3);
 q.Put(&e1);
 q.Put(&e5);
 q.Put(&e4);
 q.Print();
 
 q.Get();
 q.Get();
 q.Print();
 
 getch();}

#pragma once
class Element
{
public:
Element* prev;
Element* next;
int value;
Element() { prev = NULL; next = NULL; value = 0; };
};