Как реализовать combineTrees и extractMin на haskell?

data BinomTree a = Node a Int [BinomTree a]
               deriving (Eq, Ord, Show)
type BinomHeap a = [BinomTree a]

-- ������ 1 -----------------------------------------
combineTrees :: Ord a => BinomTree a -> BinomTree a -> BinomTree a
combineTrees = undefined
  
-- ������ 2 -----------------------------------------
extractMin :: Ord a => BinomHeap a -> a
extractMin = undefined

-- ������ 3 ----------------------------------------- 
mergeHeaps :: Ord a => BinomHeap a -> BinomHeap a -> BinomHeap a
mergeHeaps = undefined
 
-- ������ 4 -----------------------------------------
insert :: Ord a => a -> BinomHeap a -> BinomHeap a
insert = undefined

-- ������ 5 -----------------------------------------
deleteMin :: Ord a => BinomHeap a -> BinomHeap a
deleteMin = undefined

-- ������ 6 -----------------------------------------
binomSort :: Ord a => [a] -> [a]
binomSort = undefined

-- ������ 7 -----------------------------------------
toBinary :: BinomHeap a -> [Int]
toBinary = undefined