static void BinomialQueueTest() { int[] datas = { 13, 23, 51, 24, 65, 12, 21, 24, 65, 14, 26, 16, 18 }; BinomialQueue <int> bQueue = new BinomialQueue <int>(); foreach (var data in datas) { bQueue.Add(data); } bQueue.DeleteMin(); }
public void Add(T value) { if (IsEmpty()) { Node node = new Node(value); k = 1; queue[0] = node; min = value; } else { BinomialQueue <T> tempQueue = new BinomialQueue <T>(capacity); tempQueue.Add(value); this.Merge(tempQueue); } }