#ifndef F_LIST_H
#define F_LIST_H
struct Node{
  int value;
  Node* next;
  Node* prev;
};
class F_list{
public:
  void deleteInd(int);
  void deleteNod(Node);
  ~F_list();
private:
  Node* head;
  Node* tail;
};

#endif // F_LIST_H

#include <iostream>
#include "f_list.h"

F_list::F_list()
  :head(nullptr), tail(nullptr)
{
}

F_list::~F_list(){

}
void F_list::deleteNod(Node n){

  n->next = nullptr;
  n->prev = nullptr;
  delete n;
}
void F_list::deleteInd(int i){

}

void F_list::deleteNod(Node n){
  n->prev->next=n->next;
  n->next->prev=n->prev;
  n->next = nullptr;
  n->prev = nullptr;
  delete n;
}
void F_list::deleteInd(int i){
    Node curr;
    if (head!=nullptr) curr=head;
   for (int j=0;j<i;j++)
    {
       if(curr->next==nullptr) break;
          curr=curr->next;
    }
     if (curr!=nullptr) deleteNod(curr);
}