public void WhereKIsNegative()
{
//Arrange
Node node3 = new Node(4);
Node node5 = new Node(3);
Node node1 = new Node(7);
Node node4 = new Node(9);
Node node2 = new Node(2);
SLinkedList list = new SLinkedList(node1);
list.Insert(node2.Data);
list.Append(node3.Data);
list.InsertBefore(node4, node1);
list.InsertAfter(node5, node1);
//Act
int check = list.ValueAtIndex(-1);
//Assert
Assert.Equal(-1, check);
}
public void RequestedIndexOutsideLimit()
{
//Arrange
Node node3 = new Node(4);
Node node5 = new Node(3);
Node node1 = new Node(7);
Node node4 = new Node(9);
Node node2 = new Node(2);
SLinkedList list = new SLinkedList(node1);
list.Insert(node2.Data);
list.Append(node3.Data);
list.InsertBefore(node4, node1);
list.InsertAfter(node5, node1);
//Act
int check = list.ValueAtIndex(6);
//Assert
Assert.Equal(-1, check);
}
static void Main(string[] args)
{
SlinkedListQueue q = new SlinkedListQueue();
q.enqueue(10);
q.enqueue(20);
q.dequeue();
q.dequeue();
q.enqueue(30);
q.enqueue(40);
q.enqueue(50);
var dequedElement = q.dequeue();
Console.WriteLine("Dequeued item is " + dequedElement.key + " " + "and the next item is " + dequedElement.next.key);
BSearchTree tree = new BSearchTree();
/* Let us create following BST
* 50
* / \
* 30 70
* / \ / \
* 20 40 60 80 */
tree.insert(50);
tree.insert(30);
tree.insert(20);
tree.insert(40);
tree.insert(70);
tree.insert(60);
tree.insert(80);
Console.WriteLine("Inorder traversal of the given tree");
tree.inorder();
Console.WriteLine("\nDelete 20");
tree.deleteKey(20);
Console.WriteLine("Inorder traversal of the modified tree");
tree.inorder();
Console.WriteLine("\nDelete 30");
tree.deleteKey(30);
Console.WriteLine("Inorder traversal of the modified tree");
tree.inorder();
Console.WriteLine("\nDelete 50");
tree.deleteKey(50);
Console.WriteLine("Inorder traversal of the modified tree");
tree.inorder();
tree.dispouse();
BSearchTree treeNonRec = new BSearchTree();
/* Let us create following BST
* 50
* / \
* 30 70
* / \ / \
* 20 40 60 80 */
treeNonRec.insertNonRec(50);
treeNonRec.insertNonRec(30);
treeNonRec.insertNonRec(20);
treeNonRec.insertNonRec(40);
treeNonRec.insertNonRec(70);
treeNonRec.insertNonRec(60);
treeNonRec.insertNonRec(80);
Console.WriteLine("Inorder traversal of the given treeNonRec");
treeNonRec.inorder();
Console.WriteLine("\nDelete 20");
treeNonRec.removeNonRec(20);
Console.WriteLine("Inorder traversal of the modified treeNonRec");
treeNonRec.inorder();
Console.WriteLine("\nDelete 30");
treeNonRec.removeNonRec(30);
Console.WriteLine("Inorder traversal of the modified treeNonRec");
tree.inorder();
Console.WriteLine("\nDelete 50");
treeNonRec.RemoveNonRec(50);
Console.WriteLine("Inorder traversal of the modified treeNonRec");
treeNonRec.inorder();
var list = new SLinkedList <int>();
list.Add(1);
list.Add(2);
list.Add(3);
list.Add(4);
list.Add(5);
foreach (var item in list)
{
Console.Write(item + " ");
}
Console.WriteLine();
list.Delete(3);
list.Delete(1);
list.Delete(7);
foreach (var item in list)
{
Console.Write(item + " ");
}
Console.WriteLine();
list.AppendHead(7);
foreach (var item in list)
{
Console.Write(item + " ");
}
Console.WriteLine();
list.InsertAfter(4, 8);
foreach (var item in list)
{
Console.Write(item + " ");
}
Console.WriteLine();
Console.ReadLine();
}
