Question: -- 2. A backward list data structure -- Back Lists: Lists where elements are added to the back (snoc == rev cons) -- For example,
-- 2. A backward list data structure -- Back Lists: Lists where elements are added to the back ("snoc" == rev "cons") -- For example, the list [1,2,3] is represented as Snoc (Snoc (Snoc Nil 1) 2) 3)
-- Add an element to the beginning of a BList, like (:) does cons :: a -> BList a -> BList a cons = undefined
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
