Used this code but could not even get it to run, also how do I get the program to open and read the file I need it to so it can input the numbers i need from the document. Need in C$++$ also please upload the whole code and pictures. No one can seem to find a comment section so if you know how to get to it please let me know, if not how else can I reach you to reply with anything else im having trouble with on this code? Im using devc$++$ IDE, Also can we no longer upload multiple pictures?

Assignment is in the picture provided

main file

$//$ LinkedList.cpp : Defines the entry point for the console application.

$//$

#include "List.h$"$

#include

#include

#include

using namespace std;

int main$()$

$\{$

List $*$ list $=$ new List$()$;

string line;

ifstream myfile$("$numbers$.$txt$")$;

if $($myfile$.$is$\_$open$())$

$\{$

while $($getline$($myfile$,$ line$))$

$\{$

list$->$Insert$($stod$($line$))$;

$\}$

myfile.close$()$;

$\}$

else cout $$ "Unable to open file";

list$->$Display$()$;

list$->$DeletNegative$()$;

list$->$Display$()$;

int index;

cout $$ "Enter index to insert : $"$;

cin $>>$ index;

double num;

cout $$ "Enter number to insert : $"$;

cin $>>$ num;

list$->$Insert$($index$,$ num$)$;

list$->$Display$()$;

cout $$ "Enter index to delete : $"$;

cin $>>$ index;

list$->$Delete$($index$)$;

list$->$Display$()$;

return $0$;

$\}$

List.cpp

#include "List.h$"$

#include

using namespace std;

List::List$()$

$\{$

$\}$

List::~List$()$

$\{$

$\}$

void List::Insert$($int index, double value$)$

$\{$

int count $=1$;

Node $*$ node $=$ root;

Node $*$ parent $=$ root;

if $($node $==$ NULL && index $>1)$

$\{$

return;

$\}$;

if $($node $==$ NULL && index $==1)$

$\{$

Node $*$ newnode $=$ new Node$()$;

newnode$->$data $=$ value;

newnode$->$next $=$ NULL;

node$->$next $=$ newnode;

return;

$\}$

if $($node $!=$ NULL && index $==1)$

$\{$

Node $*$ newnode $=$ new Node$()$;

newnode$->$data $=$ value;

newnode$->$next $=$ node;

root $=$ newnode;

return;

$\}$

while $($node$->$next $!=$ NULL $)$

$\{$

parent $=$ node;

node $=$ node$->$next;

count$++$;

if $($count $==$ index$)$

break;

$\}$

if $($count $!=$ index$)$

$\{$

cout $$ "invalid index" $$ endl;

return;

$\}$

if $($node $!=$ NULL$)$

$\{$

Node $*$ newnode $=$ new Node$()$;

newnode$->$data $=$ value;

newnode$->$next $=$ NULL;

newnode$->$next $=$ node;

parent$->$next $=$ newnode;

return;

$\}$

$\}$

void List::Insert$($double value$)$

$\{$

Node $*$ node $=$ root;

if $($node $==$ NULL$)$

$\{$

root $=$ new Node$()$;

root$->$data $=$ value;

root$->$next $=$ NULL;

return;

$\}$;

while $($node$->$next $!=$ NULL$)$

$\{$

node $=$ node$->$next;

$\}$

Node $*$ newnode $=$ new Node$()$;

newnode$->$data $=$ value;

newnode$->$next $=$ NULL;

node$->$next $=$ newnode;

return;

$\}$

void List::Delete$($int index$)$

$\{$

int count $=1$;

Node $*$ node $=$ root;

Node $*$ parent $=$ root;

if $($node $==$ NULL && index $>1)$

$\{$

cout $$ "invalid index" $$ endl;

return;

$\}$;

if $($node $!=$ NULL && index $==1)$

$\{$

root $=$ node$->$next;

return;

$\}$

while $($node$->$next $!=$ NULL$)$

$\{$

parent $=$ node;

node $=$ node$->$next;

count$++$;

if $($count $==$ index$)$

break;

$\}$

if $($count $!=$ index$)$

$\{$

cout $$ "invalid index" $$ endl;

return;

$\}$

if $($node $!=$ NULL$)$

$\{$

parent$->$next $=$ node$->$next;

return;

$\}$

$\}$

void List::Display$()$

$\{$

Node $*$ node $=$ root;

if $($node $==$ NULL$)$ return;

while $($node$->$next $!=$ NULL $)$

$\{$

cout $$ node$->$data $$ endl;

node $=$ node$->$next;

$\}$

cout $$ node$->$data $$ endl;

return;

$\}$

void List::DeletNegative$()$

$\{$

Node $*$ node $=$ root;

Node $*$ parent $=$ root;

if $($node $==$ NULL$)$ return;

while $($node$->$next $!=$ NULL$)$

$\{$

if $($node$->$data $<mtext\; id="EditorElement\_45085"></mtext><mn\; id="EditorElement\_45086">0</mn><mi\; id="EditorElement\_45087">)</mi>$

$\{$

parent$->$next $=$ node$->$next;

$\}$

parent $=$ node;

node $=$ node$->$next;

$\}$

return;

$\}$

List.h

#pragma once

struct Node $\{$

double data;

struct Node $*$next;

$\}$;

class List

$\{$

public:

List$()$;

~List$()$;

void Insert$($int index, double value$)$;

void Insert$($double value$)$;

void Delete$($int index$)$;

void Display$()$;

void DeletNegative$()$;

private:

Node $*$ root;

$\}$;