Haskell

Haskell copied to clipboard

Implemented Disjoint Set, Stack and Queue Data Structures

2

### This PR to introduces: 1) Disjoint Set (Union-Find) data structure using mutable arrays within the Haskell the ST monad: It includes support for both union by rank and path...

Ramy-Badr-Ahmed

`preorder` gets the preorder traversal of a binary search tree `postorder` gets the postorder traversal of a binary search tree `foldTree` is an exercise from haskellbook.com that folds/accumulates a binary...

djtrack16

`isPrime` returns true if a positive integer is prime, false otherwise. 'isCoprime` returns true if the GCD of two positive integers is 1, false otherwise. `totient` returns the value of...

djtrack16