 			var a : BinomialTreeNode<Element>? = nil
 			var minRank = 0
 			
-			while treeIndex < children.count {
-				let tree = children[treeIndex]
-				if ignoreMinimum {
-					treeIndex += 1
-					continue
-				}
-				minRank = tree.rank
-				if tree.rank == rank {
-					a = tree
-					treeIndex += 1
-				}
-				break
-			}
+            while treeIndex < children.count {
+                let tree = children[treeIndex]
+                minRank = tree.rank
+                if tree.rank == rank {
+                    a = tree
+                    treeIndex += 1
+                }
+                break
+            }
 			
 			var b : BinomialTreeNode<Element>? = nil
 			

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

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