public void init()
{
list = new DoubleLinkedList();
}
public static void Main(string[] args)
{
DoubleLinkedList <int> lista = new DoubleLinkedList <int>();
int[] niz = new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 };
for (uint i = 0; i < niz.Length; ++i)
{
if (!lista.Push(niz[i]))
{
Console.WriteLine("greska");
}
}
if (!lista.isEmpty())
{
Console.WriteLine(lista);
}
else
{
Console.WriteLine("Greska");
}
/*try {
* int tmp = lista.getByIndex(3);
* Console.WriteLine(tmp);
* while (true) Console.WriteLine(lista.Pop());
* }
* catch (System.IndexOutOfRangeException){
* Console.WriteLine("Desio se izlazak iz skupa indeksa");
* }
* catch(System.InvalidOperationException){
* Console.WriteLine("Ne moze da se radi Pop() nad praznom listom");
* }*/
if (lista == null)
{
Console.WriteLine("Lista je null iz nekog razloga");
return;
}
lista.AddFirst(3);
lista.AddFirst(1);
//lista.Add(31, 4);
Console.WriteLine(lista);
lista.Add(2, 1);
lista.Add(0, 0);
lista.Delete(1);
Console.WriteLine(lista);
Console.WriteLine(lista.Length);
lista.Clear();
Console.WriteLine(lista);
lista.Push(1);
Console.WriteLine(lista);
lista.Clear();
niz = new int[] { 0, 1, 2, 3, 4, 5, 6, 7, 8 };
for (uint i = 0; i < niz.Length; ++i)
{
if (!lista.Push(niz[i]))
{
Console.WriteLine("greska");
}
}
Console.WriteLine(lista);
lista.Update(31, 3);
Console.WriteLine(lista);
Console.WriteLine(lista.Find(3));
}
public bool Merge(DoubleLinkedList <T> ListToMerge)
{
return(this.Add(ListToMerge));
}
static void Main(string[] args)
{
int choice, data, x;
DoubleLinkedList list = new DoubleLinkedList();
list.CreateList();
while (true)
{
Console.WriteLine("1.Display List");
Console.WriteLine("2.Insert in empty list ");
Console.WriteLine("3. Insert a node in beginning of the list");
Console.WriteLine("4. Insert a node at the end of the list");
Console.WriteLine("5. Insert a node after a specified node");
Console.WriteLine("6. Insert a node before a specified node");
Console.WriteLine("7. Delete first node");
Console.WriteLine("8. Delete last node");
Console.WriteLine("9. Delete any node ");
Console.WriteLine("10. Reverse of a list");
Console.Write(" enter your choice: ");
choice = Convert.ToInt32(Console.ReadLine());
if (choice == 11)
{
break;
}
switch (choice)
{
case 1:
list.DisplayList();
break;
case 2:
Console.Write("enter the elements to be inserted: ");
data = Convert.ToInt32(Console.ReadLine());
list.InsertInEmptyList(data);
break;
case 3:
Console.Write("Enter the elements to be inserted: ");
data = Convert.ToInt32(Console.ReadLine());
list.InsertInBeginning(data);
break;
case 4:
Console.Write("Enter the element to be inserted: ");
data = Convert.ToInt32(Console.ReadLine());
list.InsertAtEnd(data);
break;
case 5:
Console.Write("Enter the element to be inserted: ");
data = Convert.ToInt32(Console.ReadLine());
Console.Write("Enter the element after which to insert ");
x = Convert.ToInt32(Console.ReadLine());
list.InsertAfter(data, x);
break;
case 6:
Console.Write("Enter the element to be inserted: ");
data = Convert.ToInt32(Console.ReadLine());
Console.Write("Enter the element before which to insert ");
x = Convert.ToInt32(Console.ReadLine());
list.InsertBefore(data, x);
break;
case 7:
list.DeleteFirstNode();
break;
case 8:
list.DeleteLastNode();
break;
case 9:
Console.Write(" enter the element to be deleted ");
data = Convert.ToInt32(Console.ReadLine());
list.DeleteNode(data);
break;
case 10:
list.ReverseList();
break;
default:
Console.WriteLine(" wrong choice");
break;
}
Console.WriteLine();
}
Console.WriteLine(" exiting ");
}
