abdivasiyev · December 4, 2025 14:54
diff --git a/heap.hs b/heap.hs
 module Heap where

 data Heap a = Empty | Node a (Heap a) (Heap a) deriving (Show, Eq)

 merge :: (Ord a) => Heap a -> Heap a -> Heap a
 merge Empty h = h
 merge h Empty = h
 merge h1@(Node x l1 r1) h2@(Node y l2 r2)
  | x >= y = Node x (merge r1 h2) l1
  | otherwise = Node y (merge r2 h1) l2

 insert :: (Ord a) => a -> Heap a -> Heap a
 insert x h = merge (Node x Empty Empty) h

 pop :: (Ord a) => Heap a -> Maybe (a, Heap a)
 pop Empty = Nothing
 pop (Node x l r) = Just (x, merge l r)

 topN :: (Ord a) => Int -> Heap a -> [a]
 topN 0 _ = []
 topN n h = case pop h of
  Just (x, h') -> x : topN (n - 1) h'
  Nothing -> []
	module Heap where

	data Heap a = Empty \| Node a (Heap a) (Heap a) deriving (Show, Eq)

	merge :: (Ord a) => Heap a -> Heap a -> Heap a
	merge Empty h = h
	merge h Empty = h
	merge h1@(Node x l1 r1) h2@(Node y l2 r2)
	\| x >= y = Node x (merge r1 h2) l1
	\| otherwise = Node y (merge r2 h1) l2

	insert :: (Ord a) => a -> Heap a -> Heap a
	insert x h = merge (Node x Empty Empty) h

	pop :: (Ord a) => Heap a -> Maybe (a, Heap a)
	pop Empty = Nothing
	pop (Node x l r) = Just (x, merge l r)

	topN :: (Ord a) => Int -> Heap a -> [a]
	topN 0 _ = []
	topN n h = case pop h of
	Just (x, h') -> x : topN (n - 1) h'
	Nothing -> []
No results found