fold over a BinomialHeap

BinomialHeap fold.fs

static member private foldHeap nodeF leafV (h : list<BinomialTree<'a>>) = 

    let rec loop (h : list<BinomialTree<'a>>) cont =
        match h with
        | Node(_, a, h')::tl -> loop h'  (fun lacc ->  
                                loop tl (fun racc -> 
                                cont (nodeF a lacc racc))) 
        | _ -> cont leafV
           
    loop h (fun x -> x)

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