Step two in creating a fold over a BinomialHeap

BinomialHeap fold step 2.fs

static member private foldHeapStep2 c1 c2 c3 (t : list<BinomialTree<'a>>) = 

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

static member private inOrderStep2 (h : list<BinomialTree<'a>>) = BinomialHeap.foldHeap (fun acc -> acc) (fun a acc -> a::(acc)) (fun x l r -> x :: r @ l) h