Linked list implementation along with unit test The Next CEO of Stack OverflowAll your bases are belong to DijkstraInsert a Node at the Tail of a Linked ListSingly Linked List “Strange sorting” exerciseConverting a 2D Array into a 2D Linked ListImplementation of Linked ListC++11 Singly Linked List with raw pointersTransfer values from one LinkedList to anotherPersistent List with constexpr and pointersLinked List using templates and smart pointersLeetcode #146. LRUCache solution in Java (Doubly Linked List + HashMap)

Why is there a PLL in CPU?

Whats the best way to handle refactoring a big file?

If the heap is initialized for security, then why is the stack uninitialized?

When did Lisp start using symbols for arithmetic?

How do we know the LHC results are robust?

Why didn't Khan get resurrected in the Genesis Explosion?

MAZDA 3 2006 (UK) - poor acceleration then takes off at 3250 revs

Inappropriate reference requests from Journal reviewers

How do scammers retract money, while you can’t?

Fastest way to shutdown Ubuntu Mate 18.10

What does this shorthand mean?

Describing a person. What needs to be mentioned?

A pseudo-riley?

How to make a variable always equal to the result of some calculations?

Increase performance creating Mandelbrot set in python

% symbol leads to superlong (forever?) compilations

Solution of this Diophantine Equation

Does it take more energy to get to Venus or to Mars?

Should I tutor a student who I know has cheated on their homework?

Trouble understanding the speech of overseas colleagues

Rotate a column

Customer Requests (Sometimes) Drive Me Bonkers!

How do I go from 300 unfinished/half written blog posts, to published posts?

How do I construct this japanese bowl?



Linked list implementation along with unit test



The Next CEO of Stack OverflowAll your bases are belong to DijkstraInsert a Node at the Tail of a Linked ListSingly Linked List “Strange sorting” exerciseConverting a 2D Array into a 2D Linked ListImplementation of Linked ListC++11 Singly Linked List with raw pointersTransfer values from one LinkedList to anotherPersistent List with constexpr and pointersLinked List using templates and smart pointersLeetcode #146. LRUCache solution in Java (Doubly Linked List + HashMap)










1












$begingroup$


I want to see how other people think of my code, so here it goes. This is my first time writing a unit test. I'm wondering if there needs to be more tests for the LinkedList class and also if I'm writing them correctly.



I've made the Node class public so I can use it for a binary tree implementation later.



namespace DataStructuresAndAlgorithms.DataStructures

public class Node<T>

public T Data get; set;
public Node<T> Next get; set;
public Node<T> Previous get; set;

public Node()

public Node(T t)

Data = t;





Implementation



using System;
using System.Collections.Generic;

namespace DataStructuresAndAlgorithms.DataStructures

public class LinkedList<T>

public Node<T> Head get; private set;
public Node<T> Tail get; private set;

public LinkedList(Node<T> node)

Head = node;
Tail = node;


public void AddToFirst(Node<T> toAdd)

toAdd.Next = Head;
Head = toAdd;


public void AddToLast(Node<T> toAdd)

Tail.Next = toAdd;
Tail = toAdd;


public void RemoveFirst()

Head = Head.Next;


public void RemoveLast()

var pointer = Head;
while (pointer.Next != Tail)

pointer = pointer.Next;

// pointer is now before Tail
Tail = pointer;
Tail.Next = null;


public IEnumerator<Node<T>> GetEnumerator()

var pointer = Head;
while (pointer != null)

yield return pointer;
pointer = pointer.Next;







Unit Test



using System;
using Xunit;

using DataStructuresAndAlgorithms.DataStructures;

namespace DataStructuresAndAlgorithms.DataStructures.Tests

public class LinkedListTest

[Fact]
public void AddToFirst_Node_Should_Become_Head()

// Arrange
var myLinkedList = new LinkedList<int>(new Node<int>(45));

// Act
var nodeToAdd = new Node<int>(67);
myLinkedList.AddToFirst(nodeToAdd);

// Assert
var theNode = GetNodeFromList<int>(myLinkedList, nodeToAdd);
Assert.Equal(nodeToAdd, theNode);
Assert.Equal(45, theNode.Next.Data);


[Fact]
public void AddToLast_Node_Should_Become_Tail()

// Arrange
var myLinkedList = new LinkedList<int>(new Node<int>(35));

// Act
var nodeToAdd = new Node<int>(14);
myLinkedList.AddToLast(nodeToAdd);

// Assert
var theNode = GetNodeFromList<int>(myLinkedList, nodeToAdd);
Assert.Equal(nodeToAdd, theNode);


[Fact]
public void RemoveFirst_Next_Node_Should_Be_Head()

// Arrange
var myLinkedList = new LinkedList<int>(new Node<int>(777));

var node1 = new Node<int>(1);
myLinkedList.AddToLast(node1);

var node2 = new Node<int>(2);
myLinkedList.AddToLast(node2);

var node3 = new Node<int>(3);
myLinkedList.AddToLast(node3);

// Act
myLinkedList.RemoveFirst();

// Assert
var theNode = GetNodeFromList<int>(myLinkedList, node1);
Assert.Equal(node1, myLinkedList.Head);


[Fact]
public void RemoveLast_Next_Node_Should_Be_Tail()

// Arrange
var myLinkedList = new LinkedList<int>(new Node<int>(777));

var node1 = new Node<int>(1);
myLinkedList.AddToLast(node1);

var node2 = new Node<int>(2);
myLinkedList.AddToLast(node2);

var node3 = new Node<int>(3);
myLinkedList.AddToLast(node3);

// Act
myLinkedList.RemoveLast();

// Assert
var theNode = GetNodeFromList<int>(myLinkedList, node2);
Assert.Equal(node2, myLinkedList.Tail);


public static Node<T> GetNodeFromList<T>(LinkedList<T> someLinkedList, Node<T> someNode) where T : struct

using (var itr = someLinkedList.GetEnumerator())

while (itr.Current != someNode)

itr.MoveNext();

return itr.Current;







Presentation



using System;
using System.Collections;

using DataStructuresAndAlgorithms.DataStructures;

namespace DataStructuresAndAlgorithms.Presentation.Console

class Program

static void Main(string[] args)

RunNode();
System.Console.WriteLine();
RunLinkedList();


static void RunNode()

System.Console.WriteLine("Running the Node class");
System.Console.WriteLine("----------------------");
var myNode = new Node<int>(32);
System.Console.WriteLine(myNode.Data);


static void RunLinkedList()

System.Console.WriteLine("Running the LinkedList class");
System.Console.WriteLine("----------------------------");
var myLinkedList = new LinkedList<int>(new Node<int>(99));
myLinkedList.AddToFirst(new Node<int>(56));
myLinkedList.AddToFirst(new Node<int>(23));
myLinkedList.AddToFirst(new Node<int>(33));
myLinkedList.AddToLast(new Node<int>(8888));
myLinkedList.RemoveLast();
myLinkedList.RemoveFirst();
System.Console.WriteLine("HEAD = " + myLinkedList.Head.Data);
System.Console.WriteLine("TAIL = " + myLinkedList.Tail.Data);

using (var linkedListEnumerator = myLinkedList.GetEnumerator())

while (linkedListEnumerator.MoveNext())

System.Console.WriteLine(linkedListEnumerator.Current.Data);






```








share







New contributor




feature_creep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$
















    1












    $begingroup$


    I want to see how other people think of my code, so here it goes. This is my first time writing a unit test. I'm wondering if there needs to be more tests for the LinkedList class and also if I'm writing them correctly.



    I've made the Node class public so I can use it for a binary tree implementation later.



    namespace DataStructuresAndAlgorithms.DataStructures

    public class Node<T>

    public T Data get; set;
    public Node<T> Next get; set;
    public Node<T> Previous get; set;

    public Node()

    public Node(T t)

    Data = t;





    Implementation



    using System;
    using System.Collections.Generic;

    namespace DataStructuresAndAlgorithms.DataStructures

    public class LinkedList<T>

    public Node<T> Head get; private set;
    public Node<T> Tail get; private set;

    public LinkedList(Node<T> node)

    Head = node;
    Tail = node;


    public void AddToFirst(Node<T> toAdd)

    toAdd.Next = Head;
    Head = toAdd;


    public void AddToLast(Node<T> toAdd)

    Tail.Next = toAdd;
    Tail = toAdd;


    public void RemoveFirst()

    Head = Head.Next;


    public void RemoveLast()

    var pointer = Head;
    while (pointer.Next != Tail)

    pointer = pointer.Next;

    // pointer is now before Tail
    Tail = pointer;
    Tail.Next = null;


    public IEnumerator<Node<T>> GetEnumerator()

    var pointer = Head;
    while (pointer != null)

    yield return pointer;
    pointer = pointer.Next;







    Unit Test



    using System;
    using Xunit;

    using DataStructuresAndAlgorithms.DataStructures;

    namespace DataStructuresAndAlgorithms.DataStructures.Tests

    public class LinkedListTest

    [Fact]
    public void AddToFirst_Node_Should_Become_Head()

    // Arrange
    var myLinkedList = new LinkedList<int>(new Node<int>(45));

    // Act
    var nodeToAdd = new Node<int>(67);
    myLinkedList.AddToFirst(nodeToAdd);

    // Assert
    var theNode = GetNodeFromList<int>(myLinkedList, nodeToAdd);
    Assert.Equal(nodeToAdd, theNode);
    Assert.Equal(45, theNode.Next.Data);


    [Fact]
    public void AddToLast_Node_Should_Become_Tail()

    // Arrange
    var myLinkedList = new LinkedList<int>(new Node<int>(35));

    // Act
    var nodeToAdd = new Node<int>(14);
    myLinkedList.AddToLast(nodeToAdd);

    // Assert
    var theNode = GetNodeFromList<int>(myLinkedList, nodeToAdd);
    Assert.Equal(nodeToAdd, theNode);


    [Fact]
    public void RemoveFirst_Next_Node_Should_Be_Head()

    // Arrange
    var myLinkedList = new LinkedList<int>(new Node<int>(777));

    var node1 = new Node<int>(1);
    myLinkedList.AddToLast(node1);

    var node2 = new Node<int>(2);
    myLinkedList.AddToLast(node2);

    var node3 = new Node<int>(3);
    myLinkedList.AddToLast(node3);

    // Act
    myLinkedList.RemoveFirst();

    // Assert
    var theNode = GetNodeFromList<int>(myLinkedList, node1);
    Assert.Equal(node1, myLinkedList.Head);


    [Fact]
    public void RemoveLast_Next_Node_Should_Be_Tail()

    // Arrange
    var myLinkedList = new LinkedList<int>(new Node<int>(777));

    var node1 = new Node<int>(1);
    myLinkedList.AddToLast(node1);

    var node2 = new Node<int>(2);
    myLinkedList.AddToLast(node2);

    var node3 = new Node<int>(3);
    myLinkedList.AddToLast(node3);

    // Act
    myLinkedList.RemoveLast();

    // Assert
    var theNode = GetNodeFromList<int>(myLinkedList, node2);
    Assert.Equal(node2, myLinkedList.Tail);


    public static Node<T> GetNodeFromList<T>(LinkedList<T> someLinkedList, Node<T> someNode) where T : struct

    using (var itr = someLinkedList.GetEnumerator())

    while (itr.Current != someNode)

    itr.MoveNext();

    return itr.Current;







    Presentation



    using System;
    using System.Collections;

    using DataStructuresAndAlgorithms.DataStructures;

    namespace DataStructuresAndAlgorithms.Presentation.Console

    class Program

    static void Main(string[] args)

    RunNode();
    System.Console.WriteLine();
    RunLinkedList();


    static void RunNode()

    System.Console.WriteLine("Running the Node class");
    System.Console.WriteLine("----------------------");
    var myNode = new Node<int>(32);
    System.Console.WriteLine(myNode.Data);


    static void RunLinkedList()

    System.Console.WriteLine("Running the LinkedList class");
    System.Console.WriteLine("----------------------------");
    var myLinkedList = new LinkedList<int>(new Node<int>(99));
    myLinkedList.AddToFirst(new Node<int>(56));
    myLinkedList.AddToFirst(new Node<int>(23));
    myLinkedList.AddToFirst(new Node<int>(33));
    myLinkedList.AddToLast(new Node<int>(8888));
    myLinkedList.RemoveLast();
    myLinkedList.RemoveFirst();
    System.Console.WriteLine("HEAD = " + myLinkedList.Head.Data);
    System.Console.WriteLine("TAIL = " + myLinkedList.Tail.Data);

    using (var linkedListEnumerator = myLinkedList.GetEnumerator())

    while (linkedListEnumerator.MoveNext())

    System.Console.WriteLine(linkedListEnumerator.Current.Data);






    ```








    share







    New contributor




    feature_creep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.







    $endgroup$














      1












      1








      1





      $begingroup$


      I want to see how other people think of my code, so here it goes. This is my first time writing a unit test. I'm wondering if there needs to be more tests for the LinkedList class and also if I'm writing them correctly.



      I've made the Node class public so I can use it for a binary tree implementation later.



      namespace DataStructuresAndAlgorithms.DataStructures

      public class Node<T>

      public T Data get; set;
      public Node<T> Next get; set;
      public Node<T> Previous get; set;

      public Node()

      public Node(T t)

      Data = t;





      Implementation



      using System;
      using System.Collections.Generic;

      namespace DataStructuresAndAlgorithms.DataStructures

      public class LinkedList<T>

      public Node<T> Head get; private set;
      public Node<T> Tail get; private set;

      public LinkedList(Node<T> node)

      Head = node;
      Tail = node;


      public void AddToFirst(Node<T> toAdd)

      toAdd.Next = Head;
      Head = toAdd;


      public void AddToLast(Node<T> toAdd)

      Tail.Next = toAdd;
      Tail = toAdd;


      public void RemoveFirst()

      Head = Head.Next;


      public void RemoveLast()

      var pointer = Head;
      while (pointer.Next != Tail)

      pointer = pointer.Next;

      // pointer is now before Tail
      Tail = pointer;
      Tail.Next = null;


      public IEnumerator<Node<T>> GetEnumerator()

      var pointer = Head;
      while (pointer != null)

      yield return pointer;
      pointer = pointer.Next;







      Unit Test



      using System;
      using Xunit;

      using DataStructuresAndAlgorithms.DataStructures;

      namespace DataStructuresAndAlgorithms.DataStructures.Tests

      public class LinkedListTest

      [Fact]
      public void AddToFirst_Node_Should_Become_Head()

      // Arrange
      var myLinkedList = new LinkedList<int>(new Node<int>(45));

      // Act
      var nodeToAdd = new Node<int>(67);
      myLinkedList.AddToFirst(nodeToAdd);

      // Assert
      var theNode = GetNodeFromList<int>(myLinkedList, nodeToAdd);
      Assert.Equal(nodeToAdd, theNode);
      Assert.Equal(45, theNode.Next.Data);


      [Fact]
      public void AddToLast_Node_Should_Become_Tail()

      // Arrange
      var myLinkedList = new LinkedList<int>(new Node<int>(35));

      // Act
      var nodeToAdd = new Node<int>(14);
      myLinkedList.AddToLast(nodeToAdd);

      // Assert
      var theNode = GetNodeFromList<int>(myLinkedList, nodeToAdd);
      Assert.Equal(nodeToAdd, theNode);


      [Fact]
      public void RemoveFirst_Next_Node_Should_Be_Head()

      // Arrange
      var myLinkedList = new LinkedList<int>(new Node<int>(777));

      var node1 = new Node<int>(1);
      myLinkedList.AddToLast(node1);

      var node2 = new Node<int>(2);
      myLinkedList.AddToLast(node2);

      var node3 = new Node<int>(3);
      myLinkedList.AddToLast(node3);

      // Act
      myLinkedList.RemoveFirst();

      // Assert
      var theNode = GetNodeFromList<int>(myLinkedList, node1);
      Assert.Equal(node1, myLinkedList.Head);


      [Fact]
      public void RemoveLast_Next_Node_Should_Be_Tail()

      // Arrange
      var myLinkedList = new LinkedList<int>(new Node<int>(777));

      var node1 = new Node<int>(1);
      myLinkedList.AddToLast(node1);

      var node2 = new Node<int>(2);
      myLinkedList.AddToLast(node2);

      var node3 = new Node<int>(3);
      myLinkedList.AddToLast(node3);

      // Act
      myLinkedList.RemoveLast();

      // Assert
      var theNode = GetNodeFromList<int>(myLinkedList, node2);
      Assert.Equal(node2, myLinkedList.Tail);


      public static Node<T> GetNodeFromList<T>(LinkedList<T> someLinkedList, Node<T> someNode) where T : struct

      using (var itr = someLinkedList.GetEnumerator())

      while (itr.Current != someNode)

      itr.MoveNext();

      return itr.Current;







      Presentation



      using System;
      using System.Collections;

      using DataStructuresAndAlgorithms.DataStructures;

      namespace DataStructuresAndAlgorithms.Presentation.Console

      class Program

      static void Main(string[] args)

      RunNode();
      System.Console.WriteLine();
      RunLinkedList();


      static void RunNode()

      System.Console.WriteLine("Running the Node class");
      System.Console.WriteLine("----------------------");
      var myNode = new Node<int>(32);
      System.Console.WriteLine(myNode.Data);


      static void RunLinkedList()

      System.Console.WriteLine("Running the LinkedList class");
      System.Console.WriteLine("----------------------------");
      var myLinkedList = new LinkedList<int>(new Node<int>(99));
      myLinkedList.AddToFirst(new Node<int>(56));
      myLinkedList.AddToFirst(new Node<int>(23));
      myLinkedList.AddToFirst(new Node<int>(33));
      myLinkedList.AddToLast(new Node<int>(8888));
      myLinkedList.RemoveLast();
      myLinkedList.RemoveFirst();
      System.Console.WriteLine("HEAD = " + myLinkedList.Head.Data);
      System.Console.WriteLine("TAIL = " + myLinkedList.Tail.Data);

      using (var linkedListEnumerator = myLinkedList.GetEnumerator())

      while (linkedListEnumerator.MoveNext())

      System.Console.WriteLine(linkedListEnumerator.Current.Data);






      ```








      share







      New contributor




      feature_creep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.







      $endgroup$




      I want to see how other people think of my code, so here it goes. This is my first time writing a unit test. I'm wondering if there needs to be more tests for the LinkedList class and also if I'm writing them correctly.



      I've made the Node class public so I can use it for a binary tree implementation later.



      namespace DataStructuresAndAlgorithms.DataStructures

      public class Node<T>

      public T Data get; set;
      public Node<T> Next get; set;
      public Node<T> Previous get; set;

      public Node()

      public Node(T t)

      Data = t;





      Implementation



      using System;
      using System.Collections.Generic;

      namespace DataStructuresAndAlgorithms.DataStructures

      public class LinkedList<T>

      public Node<T> Head get; private set;
      public Node<T> Tail get; private set;

      public LinkedList(Node<T> node)

      Head = node;
      Tail = node;


      public void AddToFirst(Node<T> toAdd)

      toAdd.Next = Head;
      Head = toAdd;


      public void AddToLast(Node<T> toAdd)

      Tail.Next = toAdd;
      Tail = toAdd;


      public void RemoveFirst()

      Head = Head.Next;


      public void RemoveLast()

      var pointer = Head;
      while (pointer.Next != Tail)

      pointer = pointer.Next;

      // pointer is now before Tail
      Tail = pointer;
      Tail.Next = null;


      public IEnumerator<Node<T>> GetEnumerator()

      var pointer = Head;
      while (pointer != null)

      yield return pointer;
      pointer = pointer.Next;







      Unit Test



      using System;
      using Xunit;

      using DataStructuresAndAlgorithms.DataStructures;

      namespace DataStructuresAndAlgorithms.DataStructures.Tests

      public class LinkedListTest

      [Fact]
      public void AddToFirst_Node_Should_Become_Head()

      // Arrange
      var myLinkedList = new LinkedList<int>(new Node<int>(45));

      // Act
      var nodeToAdd = new Node<int>(67);
      myLinkedList.AddToFirst(nodeToAdd);

      // Assert
      var theNode = GetNodeFromList<int>(myLinkedList, nodeToAdd);
      Assert.Equal(nodeToAdd, theNode);
      Assert.Equal(45, theNode.Next.Data);


      [Fact]
      public void AddToLast_Node_Should_Become_Tail()

      // Arrange
      var myLinkedList = new LinkedList<int>(new Node<int>(35));

      // Act
      var nodeToAdd = new Node<int>(14);
      myLinkedList.AddToLast(nodeToAdd);

      // Assert
      var theNode = GetNodeFromList<int>(myLinkedList, nodeToAdd);
      Assert.Equal(nodeToAdd, theNode);


      [Fact]
      public void RemoveFirst_Next_Node_Should_Be_Head()

      // Arrange
      var myLinkedList = new LinkedList<int>(new Node<int>(777));

      var node1 = new Node<int>(1);
      myLinkedList.AddToLast(node1);

      var node2 = new Node<int>(2);
      myLinkedList.AddToLast(node2);

      var node3 = new Node<int>(3);
      myLinkedList.AddToLast(node3);

      // Act
      myLinkedList.RemoveFirst();

      // Assert
      var theNode = GetNodeFromList<int>(myLinkedList, node1);
      Assert.Equal(node1, myLinkedList.Head);


      [Fact]
      public void RemoveLast_Next_Node_Should_Be_Tail()

      // Arrange
      var myLinkedList = new LinkedList<int>(new Node<int>(777));

      var node1 = new Node<int>(1);
      myLinkedList.AddToLast(node1);

      var node2 = new Node<int>(2);
      myLinkedList.AddToLast(node2);

      var node3 = new Node<int>(3);
      myLinkedList.AddToLast(node3);

      // Act
      myLinkedList.RemoveLast();

      // Assert
      var theNode = GetNodeFromList<int>(myLinkedList, node2);
      Assert.Equal(node2, myLinkedList.Tail);


      public static Node<T> GetNodeFromList<T>(LinkedList<T> someLinkedList, Node<T> someNode) where T : struct

      using (var itr = someLinkedList.GetEnumerator())

      while (itr.Current != someNode)

      itr.MoveNext();

      return itr.Current;







      Presentation



      using System;
      using System.Collections;

      using DataStructuresAndAlgorithms.DataStructures;

      namespace DataStructuresAndAlgorithms.Presentation.Console

      class Program

      static void Main(string[] args)

      RunNode();
      System.Console.WriteLine();
      RunLinkedList();


      static void RunNode()

      System.Console.WriteLine("Running the Node class");
      System.Console.WriteLine("----------------------");
      var myNode = new Node<int>(32);
      System.Console.WriteLine(myNode.Data);


      static void RunLinkedList()

      System.Console.WriteLine("Running the LinkedList class");
      System.Console.WriteLine("----------------------------");
      var myLinkedList = new LinkedList<int>(new Node<int>(99));
      myLinkedList.AddToFirst(new Node<int>(56));
      myLinkedList.AddToFirst(new Node<int>(23));
      myLinkedList.AddToFirst(new Node<int>(33));
      myLinkedList.AddToLast(new Node<int>(8888));
      myLinkedList.RemoveLast();
      myLinkedList.RemoveFirst();
      System.Console.WriteLine("HEAD = " + myLinkedList.Head.Data);
      System.Console.WriteLine("TAIL = " + myLinkedList.Tail.Data);

      using (var linkedListEnumerator = myLinkedList.GetEnumerator())

      while (linkedListEnumerator.MoveNext())

      System.Console.WriteLine(linkedListEnumerator.Current.Data);






      ```






      c# linked-list





      share







      New contributor




      feature_creep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.










      share







      New contributor




      feature_creep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.








      share



      share






      New contributor




      feature_creep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 2 mins ago









      feature_creepfeature_creep

      61




      61




      New contributor




      feature_creep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      feature_creep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      feature_creep is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.




















          0






          active

          oldest

          votes












          Your Answer





          StackExchange.ifUsing("editor", function ()
          return StackExchange.using("mathjaxEditing", function ()
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
          );
          );
          , "mathjax-editing");

          StackExchange.ifUsing("editor", function ()
          StackExchange.using("externalEditor", function ()
          StackExchange.using("snippets", function ()
          StackExchange.snippets.init();
          );
          );
          , "code-snippets");

          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "196"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: false,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: null,
          bindNavPrevention: true,
          postfix: "",
          imageUploader:
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          ,
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );






          feature_creep is a new contributor. Be nice, and check out our Code of Conduct.









          draft saved

          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216453%2flinked-list-implementation-along-with-unit-test%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          feature_creep is a new contributor. Be nice, and check out our Code of Conduct.









          draft saved

          draft discarded


















          feature_creep is a new contributor. Be nice, and check out our Code of Conduct.












          feature_creep is a new contributor. Be nice, and check out our Code of Conduct.











          feature_creep is a new contributor. Be nice, and check out our Code of Conduct.














          Thanks for contributing an answer to Code Review Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid


          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.

          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216453%2flinked-list-implementation-along-with-unit-test%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          名間水力發電廠 目录 沿革 設施 鄰近設施 註釋 外部連結 导航菜单23°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.7113923°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.71139計畫概要原始内容臺灣第一座BOT 模式開發的水力發電廠-名間水力電廠名間水力發電廠 水利署首件BOT案原始内容《小檔案》名間電廠 首座BOT水力發電廠原始内容名間電廠BOT - 經濟部水利署中區水資源局

          Prove that NP is closed under karp reduction?Space(n) not closed under Karp reductions - what about NTime(n)?Class P is closed under rotation?Prove or disprove that $NL$ is closed under polynomial many-one reductions$mathbfNC_2$ is closed under log-space reductionOn Karp reductionwhen can I know if a class (complexity) is closed under reduction (cook/karp)Check if class $PSPACE$ is closed under polyonomially space reductionIs NPSPACE also closed under polynomial-time reduction and under log-space reduction?Prove PSPACE is closed under complement?Prove PSPACE is closed under union?

          Is my guitar’s action too high? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Strings too stiff on a recently purchased acoustic guitar | Cort AD880CEIs the action of my guitar really high?Μy little finger is too weak to play guitarWith guitar, how long should I give my fingers to strengthen / callous?When playing a fret the guitar sounds mutedPlaying (Barre) chords up the guitar neckI think my guitar strings are wound too tight and I can't play barre chordsF barre chord on an SG guitarHow to find to the right strings of a barre chord by feel?High action on higher fret on my steel acoustic guitar