Exemplo n.º 1
0
        public static void DoubleLinkedListFunctions()
        {
            DLinkedList list = new DLinkedList();

            list.head = new DLinkedList.Node(2);
            list.InsertAtFront(0);

            list.InsertAfterNode(list.head, 1);

            list.InsertAtEnd(3);

            //DLinkedList.Node delNode = list.head.getNext().getNext();
            //list.DeleteNode(delNode);

            list.ReverseList(); //O(N) complexity
        }