Repository navigation
Expand file tree
/
Copy pathLinkList.cs
More file actions
126 lines (111 loc) · 3.07 KB
/
Copy pathLinkList.cs
File metadata and controls
126 lines (111 loc) · 3.07 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Xml.Linq;
namespace LinkedList
{
public class LinkedListGen<T> where T:IComparable<T>
{
private NodeGen<T> head;
public LinkedListGen()
{
head = null;
}
public void AddToHead(T item) //newnode.next make sure head isn't lost.
{
NodeGen<T> newNode = new NodeGen<T>(item);
if (head == null)
{
head = newNode;
return;
}
newNode.Next = head;
head = newNode;
}
public string DisplayItems()
{
NodeGen<T> temp = head;
string buffer = " ";
while(temp != null)
{
if (buffer.Length == 0)
{
buffer = buffer + temp.Data;
} else
{
buffer = buffer + "->" + temp.Data;
temp = temp.Next;
}
}
return buffer;
}
public int NumberOfItems()
{
NodeGen<T> temp = head;
int count = 0;
while (temp != null)
{
count++;
temp = temp.Next;
}
return count;
}
public void AddToIndex(T element, int index)
{
NodeGen<T> temp = head;
NodeGen<T> newNode = new NodeGen<T>(element);
for (int i = 1; i < index -1; i++)
{
temp = temp.Next;
}
newNode.Next = temp.Next;
temp.Next = newNode;
}
public LinkedListGen<T> RemoveItem(T item)
{
NodeGen<T> temp = head;
LinkedListGen<T> newList = new LinkedListGen<T>();
while(temp != null)
{
if (item.CompareTo(temp.Data) != 0)
{
newList.AppendItem(temp.Data);
temp = temp.Next;
}
}
return newList;
}
public void AppendItem(T item)
{
NodeGen<T> temp = head;
NodeGen<T> newNode = new NodeGen<T>(item);
if (head == null)
{
head = newNode;
return;
}
while(temp.Next != null)
{
temp = temp.Next;
}
temp.Next = newNode;
}
public bool IsPresent(T item)
{
NodeGen<T> temp = head;
while (temp != null)
{
if (temp.Data.CompareTo(item) == 0)
{
return true;
} else
{
temp = temp.Next;
}
}
return false;
}
}
}