Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
T
TDIU20
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Iterations
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Package registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
cpp-programmering
TDIU20
Commits
14c579fd
Commit
14c579fd
authored
1 year ago
by
Alrik Appelfeldt
Browse files
Options
Downloads
Patches
Plain Diff
Delete linked_list.cc
parent
f0ca93bd
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
list/linked_list.cc
+0
-187
0 additions, 187 deletions
list/linked_list.cc
with
0 additions
and
187 deletions
list/linked_list.cc
deleted
100644 → 0
+
0
−
187
View file @
f0ca93bd
#include
"linked_list.h"
//Insert node at head
//skap tom lista
List
::
List
()
:
head
{
nullptr
},
tail
{
nullptr
}
{}
List
::~
List
()
{
if
(
List_Is_Empty
()
==
false
){
Node
*
my_node
=
head
;
while
(
my_node
!=
tail
){
my_node
=
my_node
->
next
;
delete
my_node
->
previous
;
}
delete
my_node
;
head
=
nullptr
;
tail
=
nullptr
;
list_size
=
0
;
}
}
bool
List
::
List_Is_Empty
(){
if
(
head
==
nullptr
)
{
return
true
;
}
else
{
return
false
;
}
}
//List::Node::Node(int new_value):
// value{new_value}
//{}
//omskriven insert funktion SOM INTE ÄR TESTAD
/* void List::Insert_Head_Node(int value){
if(List_Is_Empty() == true ){
Node* my_node = new Node(value);
my_node->previous = nullptr;
my_node->next = nullptr;
head = my_node;
tail = my_node;
}
else
{
Node* my_node = new Node(value);
my_node->previous = tail;
my_node->next = nullptr;
tail->next = my_node;
tail = my_node;
}
}
*/
void
List
::
Insert_Head_Node
(
int
value
){
Node
*
my_node
=
new
Node
(
value
);
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
(
value
);
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
newlist
;
newlist
.
Insert_Head_Node
(
5
);
newlist
.
Insert_Tail_Node
(
3
);
newlist
.
Insert_Tail_Node
(
1
);
newlist
.
printlist
(
newlist
.
head
);
return
0
;
}
/*
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
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment