(** ** Building a heap from a list *)
#[deprecated(since="8.3", note="Use mergesort.v")]

Lemma list_to_heap : forall l:list A, build_heap l.
Inductive flat_spec (T:Tree) : Type :=
flat_exist :
forall l:list A,
Sorted leA l ->
(forall a:A, leA_Tree a T -> HdRel leA a l) ->
meq (contents T) (list_contents _ eqA_dec l) -> flat_spec T.