QuickCheck.scala

  property("meld two heaps with mins") = forAll { (h1: H, h2: H) =>
    def getSeq(l: List[A], heap: H): List[A] = isEmpty(heap) match {
      case true => l.reverse
      case false => getSeq(findMin(heap) :: l, deleteMin(heap))
    }

    if (isEmpty(h1) || isEmpty(h2)) true
    else {
      val melded = getSeq(List(), meld(h1, h2))
      val melded2 = getSeq(List(), meld(deleteMin(h1), insert(findMin(h1), h2)))
      melded.sorted == melded2.sorted
    }
  }