public void Compare(DoublyLinkedList <T> list) { var temp1 = this._header.Next; var temp2 = list._header.Next; while (temp1 != null && temp2 != null) { if (AreEqual(temp1.Data, temp2.Data)) { temp1 = temp1.Next; temp2 = temp2.Next; } else { Console.WriteLine("Not Equal"); return; } } Console.WriteLine("Equal"); }
public void RemoveAtIndexes(DoublyLinkedList <int> list) { if (Type.GetTypeCode(this.GetType()) == TypeCode.Int32) { this.OrderIncreasing(); } ; list.RemoveRedundancy(); list.OrderIncreasing(); var temp = list._header.Next; int counter = 1; while (temp.Next != null) { this.DeleteFromPosition((Convert.ToInt32(temp.Data)) - counter); temp = temp.Next; counter++; } }
static void Main(string[] args) { ILinkedList <int> ilist = new CircularLinkedList <int>();; ilist.AddToTail(new Node <int>(1)); ilist.AddToTail(new Node <int>(2)); ilist.AddToTail(new Node <int>(3)); ilist.AddToTail(new Node <int>(4)); ilist.AddToTail(new Node <int>(5)); ilist.MoveTailToRight(1); ilist.MoveTailToRight(1); DoublyLinkedList <int> list = new DoublyLinkedList <int>(); list.AddToTail(new Node <int>(1)); list.AddToTail(new Node <int>(2)); list.AddToTail(new Node <int>(3)); list.AddToTail(new Node <int>(4)); list.AddToTail(new Node <int>(5)); CircularLinkedList <int> list1 = new CircularLinkedList <int>(); list1.AddToTail(new Node <int>(1)); list1.AddToTail(new Node <int>(2)); list1.AddToTail(new Node <int>(3)); list1.AddToTail(new Node <int>(4)); list1.AddToTail(new Node <int>(5)); list1.MoveTailToRight(1); list1.MoveTailToRight(1); list1.PrintList(); Console.ReadLine(); }