Using visual studio 2022- a C# windows form application- and your Doub.pdf

Using visual studio 2022, a C# windows form application, and your DoubleLinkedClass and
DoubleLinkedNode classes from project 5, implement a DequeueClass, a StackClass, and a
QueueClass. Do not use any arrays, lists, dictionaries, or other built in data structures, only
instances of your linkedLists classes from project 5. The dequeue class needs to contain a
reference to an instance of your DoubleLinkedList class, with the QueueClass and StackClass
inheriting from the Dequeue class. Your Stack and Queue pop and push need to be one-line calls
to the Dequeue popLeft, pushLeft, popRight, pushRight. Do not copy the code from the dequeue
class to implement the Stack and Queue.
DoubleLinkedClasses From2263Project5
internal class DoubleLinkedList<T>
{
public DoubleLinkedListNode<T> firstNode = null;
public DoubleLinkedListNode<T> lastNode = null;
public DoubleLinkedListNode<T> currentNode = null;
public int nodeNumber = 0;
public DoubleLinkedList()
{
}
// creates first node in list with firstValue
public DoubleLinkedList(T firstValue)
{
firstNode = new DoubleLinkedListNode<T>(firstValue);
lastNode = firstNode;
currentNode = firstNode;
nodeNumber = 1;
}
public DoubleLinkedListNode<T> GetCurrentNode()
{
return currentNode;
}
public void InsertFirst(T value)
{
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
if (firstNode == null)
{
firstNode = newNode;
lastNode = firstNode;

}
else
{
newNode.next = firstNode;
firstNode.previous = newNode;
}
nodeNumber++;
}
public void InsertBeforeFirst(T value)
{
{
InsertFirst(value);
return;
}
newNode.next = firstNode;
firstNode.previous = newNode;
nodeNumber++;
}
public void InsertAfterLast(T value)
{
if (lastNode == null)
{
InsertFirst(value);
return;
}
lastNode.next = newNode;
newNode.previous = lastNode;
lastNode = newNode;
currentNode = lastNode;
nodeNumber++;
}
public void InsertAfterCurrent(T value)

{
if (currentNode == null)
{
InsertFirst(value);
return;
}
newNode.next = currentNode.next;
newNode.previous = currentNode;
if (currentNode.next != null)
{
currentNode.next.previous = newNode;
}
currentNode.next = newNode;
currentNode = newNode;
if (lastNode == currentNode.previous)
{
lastNode = currentNode;
}
nodeNumber++;
}
public int NumberOfNodesInList()
{
return nodeNumber;
}
public void DeleteFirst()
{
{
return;
}
if (firstNode.next == null)
{
firstNode = null;
lastNode = null;
currentNode = null;
}
else
{
firstNode = firstNode.next;
firstNode.previous = null;
}

nodeNumber--;
}
public void DeleteLast()
{
if (lastNode == null)
{
return;
}
if (lastNode.previous == null)
{
firstNode = null;
lastNode = null;
currentNode = null;
}
else
{
lastNode = lastNode.previous;
lastNode.next = null;
currentNode = lastNode;
}
nodeNumber--;
}
public void DeleteCurrent()
{
if (currentNode == null)
{
return;
}
if (currentNode.previous == null)
{
DeleteFirst();
return;
}
if (currentNode.next == null)
{
DeleteLast();
return;
}
currentNode.previous.next = currentNode.next;
currentNode.next.previous = currentNode.previous;
currentNode = currentNode.next;

nodeNumber--;
}
public void MoveToNext()
{
if (currentNode == null || currentNode.next == null)
{
return;
}
currentNode = currentNode.next;
}
public void MoveToPrevious()
{
if (currentNode == null || currentNode.previous == null)
{
return;
}
currentNode = currentNode.previous;
}
public DoubleLinkedListNode<T> Find(T value)
{
return FindRecursive(firstNode, value);
}
private DoubleLinkedListNode<T> FindRecursive(DoubleLinkedListNode<T> node, T value)
{
if (node == null)
{
return null;
}
if (node.value.Equals(value))
{
return node;
}
return FindRecursive(node.next, value);
}
public string GetDisplayString()
{

{
return "";
}
return GetDisplayStringRecursive(firstNode);
}
private string GetDisplayStringRecursive(DoubleLinkedListNode<T> node)
{
if (node == null)
{
return "";
}
string result = node.value.ToString() + " ";
result += GetDisplayStringRecursive(node.next);
return result;
}
}
internal class DoubleLinkedListNode<T>
{
public T value;
public DoubleLinkedListNode<T> next = null;
public DoubleLinkedListNode<T> previous = null;
public DoubleLinkedListNode(T value)
{
this.value = value;
previous = null;
next = null;
}
private DoubleLinkedListNode()
{
value = default(T);
}
}
Develop a test harness, that allows testing rapid, but effective testing of your classes, including
inserting and deleting 6 or more integers, including completely filling, completely emptying, and
then refilling your data structures

Using visual studio 2022- a C# windows form application- and your Doub.pdf

Using visual studio 2022- a C# windows form application- and your Doub.pdf

More Related Content

Similar to Using visual studio 2022- a C# windows form application- and your Doub.pdf (20)

More from acteleshoppe (20)

Recently uploaded (20)

Using visual studio 2022- a C# windows form application- and your Doub.pdf