Двусвязный список: переместить во второй список элементы, стоящие между минимальным и максимальным элементами первого

#include <iostream>
#include <windows.h>
using namespace std;
 
struct Queue2
{
  int data;
  Queue2* next;
  Queue2* prev;
};
 
int Menu();
void Add(Queue2**, Queue2**);
void Add(Queue2**, Queue2**, int);
void View(Queue2*, Queue2*);
void View_back(Queue2*, Queue2*);
void Delete(Queue2**, Queue2**);
void Delete(Queue2**, Queue2**, Queue2*);
void Task(Queue2**, Queue2**, Queue2**, Queue2**);
Queue2* Min(Queue2*, Queue2*);
Queue2* Max(Queue2*, Queue2*);
bool isEmpty(Queue2*, Queue2*);
 
 
 
void Add(Queue2** head, Queue2** tail)
{
  int i, count;
  int data;
 
  do
  {
    cout << "Enter count:\n";
    cin >> count;
  } while (count < 1);
 
  for (i = 0; i < count; i++)
  {
    cout << "Enter data: ";
    cin >> data;
 
    Add(head, tail, data);
  }
}
 
void Add(Queue2** head, Queue2** tail, int data)
{
  Queue2* temp;
 
  temp = new Queue2;
  temp->data = data;
  temp->next = NULL;
 
  if (*head)
  {
    temp->prev = *tail;
    (*tail)->next = temp;
  }
  else
  {
    temp->prev = NULL;
    *head = temp;
  }
  *tail = temp;
}
 
void View(Queue2* head,  Queue2* tail)
{
  Queue2* temp;
 
  if (isEmpty(head, tail))
  {
    cout << "\nList is Empty\n";
    return;
  }
 
  cout << "\nlist:\n";
  temp = head;
  while (temp)
  {
    cout << temp->data << "   ";
    temp = temp->next;
  }
  cout << endl;
}
 
void View_back(Queue2* head, Queue2* tail)
{
  Queue2* temp;
 
  if (isEmpty(head, tail))
  {
    cout << "\nList is Empty\n";
    return;
  }
 
  cout << "\nback list:\n";
  temp = tail;
  while (temp)
  {
    cout << temp->data << "   ";
    temp = temp->prev;
  }
  cout << endl;
}
 
void Delete(Queue2** head, Queue2** tail)
{
  Queue2* temp;
 
  if (isEmpty(*head, *tail))
  {
    cout << "\nList is Empty\n";
    return;
  }
 
  cout << "\nDelete element:\n";
  while (*head)
  {
    cout << (*head)->data << "  ";
    temp = *head;
 
    if ((*head)->next)
    {
      *head = (*head)->next;
      (*head)->prev = NULL;
    }
    else
      *head = NULL;
 
    delete temp;
  }
}
 
void Delete(Queue2** head, Queue2** tail, Queue2* temp)
{
  Queue2* tmp;
 
  tmp = temp->next;
  cout << tmp->data << "   ";
 
  tmp->next->prev = tmp->prev;
  temp->next = tmp->next;
 
  delete tmp;
}
 
void Task(Queue2** head, Queue2** tail, Queue2** head_new, Queue2** tail_new)
{
  Queue2* temp, *min, *max;
 
  if (isEmpty(*head, *tail))
  {
    cout << "\nList is Empty\n";
    return;
  }
 
  min = Min(*head, *tail);
  max = Max(*head, *tail);
 
  if (min == max)
  {
    cout << "\nmin==max\n";
    return;
  }
 
  if (min->next == max  max->next==min)
  {
    cout << "\nbetween min and max no elements\n";
    return;
  }
 
 
  cout << "\ndelete element between min and max\n";
  temp = *head;
  while (temp != min  temp != max)
    temp = temp->next;
 
while (temp->next != max  temp->next!=min)
  {
    Add(head_new, tail_new, temp->next->data);
    Delete(head, tail, temp);
  }
}
 
Queue2* Min(Queue2* head, Queue2* tail)
{
  Queue2* temp, * min;
 
  temp = min = head;
  while (temp)
  {
    if (min->data > temp->data)
      min = temp;
    temp = temp->next;
  }
  return min;
}
 
Queue2* Max(Queue2* head, Queue2* tail)
{
  Queue2* temp, * max;
 
  temp = max = head;
  while (temp)
  {
    if (max->data < temp->data)
      max = temp;
    temp = temp->next;
  }
  return max;
}
 
bool isEmpty(Queue2* head, Queue2* tail)
{
  return !head;
}
 
 
int main()
{
  setlocale(LC_ALL, "rus");
  SetConsoleCP(1251);
  SetConsoleOutputCP(1251);
 
  Queue2* head, * tail, * head_new, * tail_new;
 
  head = tail = head_new = tail_new = NULL;
 
  while (true)
  {
    switch (Menu())
    {
   
 
    }
    cout << endl;
 
  }
 
}
 
int Menu()
{
 
  
 
}

#include <iostream>
#include <algorithm>
#include <list>
 
int main()
{ 
    std::list<int> list1{1, 2, 3, 0, 6, 8, 3, 3, 2, 2, 4, 9, 2, 2, 2, 2, 7, 8, 4, 8};
    auto [imin, imax] = std::minmax_element(list1.begin(), list1.end());
 
    std::list<int> list2;
 
    if (imin != imax)
        list2.splice(list2.end(), list1, std::next(imin), imax);
 
 
    for(int v: list1)
        std::cout << v << " ";
    std::cout << std::endl;
    for(int v: list2)
        std::cout << v << " ";
}