public List <bool> Go()
        {
            ISinglyCell <int> cell = CreatingLinkedList.Create(new SinglyCell <int>(), 10, false);
            var f = Reverse(cell);

            return(new List <bool>());
        }
        public List <string> Go()
        {
            ISinglyCell <int> head   = CreatingLinkedList.Create(new SinglyCell <int>(), 5, false);
            ISinglyCell <int> middle = FindTheMiddle(head);

            return(new List <string>());
        }
Esempio n. 3
0
        public List <string> Go()
        {
            ISinglyCell <int> cell = CreatingLinkedList.Create(new SinglyCell <int>(), 10, false);

            Print(cell);
            return(new List <string>());
        }
        public List <string> Go()
        {
            ISinglyCell <int> list1 = CreatingLinkedList.Create(new SinglyCell <int>(), 4, true);
            ISinglyCell <int> list2 = CreatingLinkedList.Create(new SinglyCell <int>(), 3, true);
            var res = RecursiveMerging(list2, list1);

            return(new List <string>());
        }
        public List <string> Go()
        {
            ISinglyCell <int> cell      = CreatingLinkedList.Create(new SinglyCell <int>(), 10, true);
            ISinglyCell <int> givenNode = new SinglyCell <int>();

            givenNode.Value = 5465;
            ISinglyCell <int> res = InsertIntoSortingLinkedList(cell, givenNode);

            return(new List <string>());
        }
Esempio n. 6
0
        public List <string> Go()
        {
            // Create general tail for two linked lists
            ISinglyCell <int> intermediate = CreatingLinkedList.Create(new SinglyCell <int>(), 4, false);
            // Creat first linked list
            ISinglyCell <int> list1 = CreatingLinkedList.Create(new SinglyCell <int>(), 3, false);

            //set tail
            GetLatestCell(list1).Next = intermediate;
            // Create second Linked List
            ISinglyCell <int> list2 = CreatingLinkedList.Create(new SinglyCell <int>(), 4, false);

            // Set tail
            GetLatestCell(list2).Next = intermediate;
            //Find InterSection Node
            var res = FindIntersectingNode(list1, list2);

            return(new List <string>());
        }
        public List <string> Go()
        {
            var res = IsLinkedListEvenGo(CreatingLinkedList.Create(new SinglyCell <int>(), 16, false));

            return(new List <string>());
        }
Esempio n. 8
0
 public InsertingLinkedListNodeByGivenPosition()
 {
     head = CreatingLinkedList.Create(new SinglyCell <int>(), 10, false);
 }
        public List <int> Go()
        {
            ISinglyCell <int> head = CreatingLinkedList.Create(new SinglyCell <int>(), 10, false);

            return(new List <int>());
        }