 		let result = children[minIndex].element
 		let formerMin = children.remove(at: minIndex)
 		
-		merge(with: formerMin.children, ignoreMinimum: false)
+		merge(with: formerMin.children)
 		
 		return result
 	}

		self.order = order
	}
	
	mutating func merge(with heads: [BinomialTreeNode<Element>], ignoreMinimum: Bool) {
		guard children.count > 0 else { children = heads; resetMinIndex(); return }
		
		var treesNew = [BinomialTreeNode<Element>]()

	}
	
	public mutating func push(_ element: Element) {
		merge(with: [BinomialTreeNode(element)])
	}
	
	public mutating func pop() -> Element? {
