Step one in creating a fold over a BinomialHeap

BinomialHeap fold step 1.fs

static member private foldHeapStep1 (h : list<BinomialTree<'a>>) = 

    let rec loop (h : list<BinomialTree<'a>>) cont =
        match h with
        | Node(_, a, [])::[] -> cont [a]
        | Node(_, a, h')::[] -> loop h' (fun acc -> cont (a :: acc))
        | Node(_, a, [])::tl -> loop tl (fun acc -> cont (a :: acc))
        | Node(_, a, h')::tl -> loop h' (fun lacc -> loop tl (fun racc -> cont (a :: racc @ lacc)))
        | _ -> failwith "can't get here"
           
    loop h (fun x -> x)

static member private inOrderStep1 (h : list<BinomialTree<'a>>) = BinomialHeap.foldHeap h