public void AddTailTest()
{
for (int i = 1; i <= 5; i++)
{
numbers.AddTail(i);
}
Assert.Equal("1", numbers.Head.nodeValue.ToString());
Assert.Equal("5", numbers.Tail.nodeValue.ToString());
}
private int[] TreeToPreorderArray(BinaryTree <int> tree)
{
DoublyLinkedList <int> actualList = new DoublyLinkedList <int>();
tree.PreOrderTraversal((value) => actualList.AddTail(value));
return(actualList.ToArray());
}
private DoublyLinkedList <int> create(int start, int end)
{
var ints = new DoublyLinkedList <int>();
for (var i = start; i <= end; i++)
{
ints.AddTail(i);
}
return(ints);
}
public void AddTail_Node_Should_Become_Tail()
{
// Arrange
int[] myNums = { 1, 2, 3, 4, 5 };
var myLinkedList = new DoublyLinkedList <int>(myNums);
// Act
myLinkedList.AddTail(7777);
// Assert
Assert.Equal(7777, myLinkedList.Tail);
}
public void AddTailTest()
{
var ints = new DoublyLinkedList <int>();
for (var i = 1; i <= 5; i++)
{
ints.AddTail(i);
Assert.AreEqual(i, ints.Count);
}
var expected = 1;
foreach (var x in ints)
{
Assert.AreEqual(expected++, x);
}
}
