Scala Reactive

one.scala

def heapList(heap: H): List[A] = {
    if (isEmpty(heap)) {
      Nil
    } else {
      findMin(heap) :: heapList(deleteMin(heap))
    }
  }
  
  property("Added and removed elements") = forAll { (h: H, values: List[A]) =>
    val listOfElemsBefore = heapList(h)
    val heapWithAll = values.foldLeft(h)((acum, value) => insert(value, acum))
    val listOfElems = heapList(heapWithAll)

    listOfElems.diff(listOfElemsBefore) == values.sorted(ord)
  }