Delete linked_list.cc

Uppgift-2-Lista/linked_list.cc

-#include "linked_list.h"
-
-//Insert node at head
-//skap tom lista
-
-    List::List() : 
-    head{nullptr}, tail{nullptr} 
-    
-    {}
-
-
-    void List::Insert_Head_Node(int value){
-    Node* my_node = new Node();
-    my_node->value = 1;
-    my_node->previous = nullptr;
-    my_node->next = nullptr;
-    head = my_node;
-    tail = my_node;
-    };
-
-    //insert node at tail 
-
-    void List::Insert_Tail_Node(int value){
-    Node* my_node = new Node();
-    my_node->value = 1;
-    my_node->previous = tail;
-    my_node->next = nullptr;
-    tail->next = my_node;
-    tail = my_node;
-    };
-
-
-
-void List::printlist(Node* head){
-Node* traverser = head;
-while(traverser != nullptr) {
-    cout<<traverser->value<<endl;
-    traverser = traverser->next; 
-}
-};
-
-int main()
-
-{
-
-
-
-List::Insert_Head_Node();
-
-List::printlist(head);
-
-}
-
-
-/*
-
-    List::Node* Head;
-    List::Node* Tail;
-  
-   
-    List::Node* node = new List::Node();
-    node->Value = 1;
-    node->previous = nullptr;
-    node->next = nullptr;
-    Head = node;
-    Tail = node;
-
-*/
-
-
-
-
-
-
-/*void printlist(List::Node*Head){
-List::Node* Traverser = Head;
-while(Traverser != nullptr) {
-    cout<<Traverser->Value<<endl;
-    Traverser = Traverser->next; 
-}
-
-
-
-int main()
-{
-    Link* Head;
-    Link* Tail;
-
-    
-//Insert node at head
-    Link* link = new Link();
-    link->Value = 1;
-    link->previous = nullptr;
-    link->next = nullptr;
-    Head = link;
-    Tail = link;
-insert node at tail 
-    link = new Link();
-    link->Value = 1;
-    link->previous = Tail;
-    link->next = nullptr;
-    Tail->next = link;
-    Tail = link;
-// node 3 (same as node 2)
-    link = new Link();
-    link->Value = 1;
-    link->previous = Tail;
-    link->next = nullptr;
-    Tail->next = link;
-    Tail = link;
-
-printlist(Head);
-
-}*/
\ No newline at end of file