# 99 questions/54A to 60

### From HaskellWiki

RossPaterson (Talk | contribs) (move data definition into 54A) |
(→Problem 60) |
||

(16 intermediate revisions by 6 users not shown) | |||

Line 1: | Line 1: | ||

__NOTOC__ |
__NOTOC__ |
||

− | This is part of [[H-99:_Ninety-Nine_Haskell_Problems|Ninety-Nine Haskell Problems]], based on [http://www.hta-bi.bfh.ch/~hew/informatik3/prolog/p-99/ Ninety-Nine Prolog Problems]. |
+ | This is part of [[H-99:_Ninety-Nine_Haskell_Problems|Ninety-Nine Haskell Problems]], based on [https://prof.ti.bfh.ch/hew1/informatik3/prolog/p-99/ Ninety-Nine Prolog Problems]. |

− | |||

− | If you want to work on one of these, put your name in the block so we know someone's working on it. Then, change n in your block to the appropriate problem number, and fill in the <Problem description>,<example in lisp>,<example in Haskell>,<solution in haskell> and <description of implementation> fields. |
||

== Binary trees == |
== Binary trees == |
||

Line 7: | Line 7: | ||

A binary tree is either empty or it is composed of a root element and two successors, which are binary trees themselves. |
A binary tree is either empty or it is composed of a root element and two successors, which are binary trees themselves. |
||

− | http://www.hta-bi.bfh.ch/~hew/informatik3/prolog/p-99/p67.gif |
+ | https://prof.ti.bfh.ch/hew1/informatik3/prolog/p-99/p67.gif |

+ | |||

+ | In Haskell, we can characterize binary trees with a datatype definition: |
||

+ | |||

+ | <haskell> |
||

+ | data Tree a = Empty | Branch a (Tree a) (Tree a) |
||

+ | deriving (Show, Eq) |
||

+ | </haskell> |
||

+ | |||

+ | This says that a <tt>Tree</tt> of type <tt>a</tt> consists of either an <tt>Empty</tt> node, or a <tt>Branch</tt> containing one value of type <tt>a</tt> with exactly two subtrees of type <tt>a</tt>. |
||

+ | |||

+ | Given this definition, the tree in the diagram above would be represented as: |
||

+ | |||

+ | <haskell> |
||

+ | tree1 = Branch 'a' (Branch 'b' (Branch 'd' Empty Empty) |
||

+ | (Branch 'e' Empty Empty)) |
||

+ | (Branch 'c' Empty |
||

+ | (Branch 'f' (Branch 'g' Empty Empty) |
||

+ | Empty)) |
||

+ | </haskell> |
||

+ | |||

+ | Since a "leaf" node is a branch with two empty subtrees, it can be useful to define a shorthand function: |
||

+ | |||

+ | <haskell> |
||

+ | leaf x = Branch x Empty Empty |
||

+ | </haskell> |
||

+ | |||

+ | Then the tree diagram above could be expressed more simply as: |
||

+ | |||

+ | <haskell> |
||

+ | tree1' = Branch 'a' (Branch 'b' (leaf 'd') |
||

+ | (leaf 'e')) |
||

+ | (Branch 'c' Empty |
||

+ | (Branch 'f' (leaf 'g') |
||

+ | Empty))) |
||

+ | </haskell> |
||

+ | |||

+ | Other examples of binary trees: |
||

+ | |||

+ | <haskell> |
||

+ | -- A binary tree consisting of a root node only |
||

+ | tree2 = Branch 'a' Empty Empty |
||

+ | |||

+ | -- An empty binary tree |
||

+ | tree3 = Empty |
||

+ | |||

+ | -- A tree of integers |
||

+ | tree4 = Branch 1 (Branch 2 Empty (Branch 4 Empty Empty)) |
||

+ | (Branch 2 Empty Empty) |
||

+ | </haskell> |
||

== Problem 54A == |
== Problem 54A == |
||

Line 16: | Line 16: | ||

Example in Lisp: |
Example in Lisp: |
||

+ | |||

<pre> |
<pre> |
||

* (istree (a (b nil nil) nil)) |
* (istree (a (b nil nil) nil)) |
||

Line 23: | Line 24: | ||

</pre> |
</pre> |
||

− | In Haskell, we characterize binary trees with a datatype definition: |
+ | Non-solution: |

− | <haskell> |
||

− | data Tree a = Empty | Branch a (Tree a) (Tree a) |
||

− | deriving (Show, Eq) |
||

− | </haskell> |
||

− | The above tree is represented as: |
||

− | <haskell> |
||

− | tree1 = Branch 'a (Branch 'b' (Branch 'd' Empty Empty) |
||

− | (Branch 'e' Empty Empty)) |
||

− | (Branch 'c' Empty |
||

− | (Branch 'f' (Branch 'g' Empty Empty) |
||

− | Empty))) |
||

− | </haskell> |
||

− | Other examples of binary trees: |
||

− | <haskell> |
||

− | tree2 = Branch 'a' Empty Empty -- a binary tree consisting of a root node only |
||

− | tree3 = nil -- an empty binary tree |
+ | Haskell's type system ensures that all terms of type <hask>Tree a</hask> are binary trees: it is just not possible to construct an invalid tree with this type. Hence, it is redundant to introduce a predicate to check this property: it would always return <hask>True</hask>. |

− | tree4 = Branch 1 (Branch 2 Empty (Branch 4 Empty Empty)) |
||

− | (Branch 2 Empty Empty) |
||

− | </haskell> |
||

− | The type system ensures that all terms of type <hask>Tree a</hask> |
||

− | are binary trees: it is just not possible to construct an invalid tree |
||

− | with this type. Hence, it is redundant to introduce a predicate to |
||

− | check this property: it would always return <hask>True</hask>. |
||

== Problem 55 == |
== Problem 55 == |
||

Line 44: | Line 38: | ||

Example: |
Example: |
||

+ | |||

<pre> |
<pre> |
||

* cbal-tree(4,T). |
* cbal-tree(4,T). |
||

Line 51: | Line 46: | ||

</pre> |
</pre> |
||

− | Example in Haskell: |
+ | Example in Haskell, whitespace and "comment diagrams" added for clarity and exposition: |

− | <pre> |
||

− | *Main> cbalTree 4 |
||

− | [Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' Empty (Branch 'x' Empty Empty)),Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' (Branch 'x' Empty Empty) Empty),Branch 'x' (Branch 'x' Empty (Branch 'x' Empty Empty)) (Branch 'x' Empty Empty),Branch 'x' (Branch 'x' (Branch 'x' Empty Empty) Empty) (Branch 'x' Empty Empty)] |
||

− | </pre> |
||

− | Solution: |
||

<haskell> |
<haskell> |
||

− | cbalTree 0 = [Empty] |
+ | *Main> cbalTree 4 |

− | cbalTree n = [Branch 'x' l r | i <- [q .. q + r], l <- cbalTree i, r <- cbalTree (n - i - 1)] |
+ | [ |

− | where (q, r) = quotRem (n-1) 2 |
+ | -- permutation 1 |

+ | -- x |
||

+ | -- / \ |
||

+ | -- x x |
||

+ | -- \ |
||

+ | -- x |
||

+ | Branch 'x' (Branch 'x' Empty Empty) |
||

+ | (Branch 'x' Empty |
||

+ | (Branch 'x' Empty Empty)), |
||

+ | |||

+ | -- permutation 2 |
||

+ | -- x |
||

+ | -- / \ |
||

+ | -- x x |
||

+ | -- / |
||

+ | -- x |
||

+ | Branch 'x' (Branch 'x' Empty Empty) |
||

+ | (Branch 'x' (Branch 'x' Empty Empty) |
||

+ | Empty), |
||

+ | |||

+ | -- permutation 3 |
||

+ | -- x |
||

+ | -- / \ |
||

+ | -- x x |
||

+ | -- \ |
||

+ | -- x |
||

+ | Branch 'x' (Branch 'x' Empty |
||

+ | (Branch 'x' Empty Empty)) |
||

+ | (Branch 'x' Empty Empty), |
||

+ | |||

+ | -- permutation 4 |
||

+ | -- x |
||

+ | -- / \ |
||

+ | -- x x |
||

+ | -- / |
||

+ | -- x |
||

+ | Branch 'x' (Branch 'x' (Branch 'x' Empty Empty) |
||

+ | Empty) |
||

+ | (Branch 'x' Empty Empty) |
||

+ | ] |
||

</haskell> |
</haskell> |
||

− | Here we use the list monad to enumerate all the trees, in a style that is more natural than standard backtracking. |
+ | [[99 questions/Solutions/55 | Solutions]] |

+ | |||

== Problem 56 == |
== Problem 56 == |
||

Line 69: | Line 63: | ||

Example in Haskell: |
Example in Haskell: |
||

− | <pre> |
+ | |

+ | <haskell> |
||

*Main> symmetric (Branch 'x' (Branch 'x' Empty Empty) Empty) |
*Main> symmetric (Branch 'x' (Branch 'x' Empty Empty) Empty) |
||

False |
False |
||

*Main> symmetric (Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' Empty Empty)) |
*Main> symmetric (Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' Empty Empty)) |
||

True |
True |
||

− | </pre> |
+ | </haskell> |

− | Solution: |
+ | [[99 questions/Solutions/56 | Solutions]] |

− | <haskell> |
||

− | mirror Empty Empty = True |
||

− | mirror (Branch _ a b) (Branch _ x y) = mirror a y && mirror b x |
||

− | mirror _ _ = False |
||

− | symmetric Empty = True |
||

− | symmetric (Branch _ l r) = mirror l r |
||

− | </haskell> |
||

== Problem 57 == |
== Problem 57 == |
||

Line 89: | Line 80: | ||

Example: |
Example: |
||

+ | |||

<pre> |
<pre> |
||

* construct([3,2,5,7,1],T). |
* construct([3,2,5,7,1],T). |
||

Line 97: | Line 89: | ||

Example: |
Example: |
||

+ | |||

<pre> |
<pre> |
||

* test-symmetric([5,3,18,1,4,12,21]). |
* test-symmetric([5,3,18,1,4,12,21]). |
||

Yes |
Yes |
||

− | * test-symmetric([3,2,5,7,1]). |
+ | * test-symmetric([3,2,5,7,4]). |

No |
No |
||

</pre> |
</pre> |
||

Example in Haskell: |
Example in Haskell: |
||

− | <pre> |
+ | |

+ | <haskell> |
||

*Main> construct [3, 2, 5, 7, 1] |
*Main> construct [3, 2, 5, 7, 1] |
||

Branch 3 (Branch 2 (Branch 1 Empty Empty) Empty) (Branch 5 Empty (Branch 7 Empty Empty)) |
Branch 3 (Branch 2 (Branch 1 Empty Empty) Empty) (Branch 5 Empty (Branch 7 Empty Empty)) |
||

Line 112: | Line 105: | ||

*Main> symmetric . construct $ [3, 2, 5, 7, 1] |
*Main> symmetric . construct $ [3, 2, 5, 7, 1] |
||

True |
True |
||

− | </pre> |
+ | </haskell> |

− | Solution: |
+ | [[99 questions/Solutions/57 | Solutions]] |

− | <haskell> |
||

− | add :: Ord a => a -> Tree a -> Tree a |
||

− | add x Empty = Branch x Empty Empty |
||

− | add x t@(Branch y l r) = case compare x y of |
||

− | LT -> Branch y (add x l) r |
||

− | GT -> Branch y l (add x r) |
||

− | EQ -> t |
||

− | construct xs = foldl (flip add) Empty xs |
||

− | </haskell> |
||

− | |||

− | Here, the definition of construct is trivial, because the pattern of accumulating from the left is captured by the standard function foldl. |
||

== Problem 58 == |
== Problem 58 == |
||

Line 128: | Line 117: | ||

Example: |
Example: |
||

+ | |||

<pre> |
<pre> |
||

* sym-cbal-trees(5,Ts). |
* sym-cbal-trees(5,Ts). |
||

Line 134: | Line 124: | ||

Example in Haskell: |
Example in Haskell: |
||

− | <pre> |
+ | |

+ | <haskell> |
||

*Main> symCbalTrees 5 |
*Main> symCbalTrees 5 |
||

[Branch 'x' (Branch 'x' Empty (Branch 'x' Empty Empty)) (Branch 'x' (Branch 'x' Empty Empty) Empty),Branch 'x' (Branch 'x' (Branch 'x' Empty Empty) Empty) (Branch 'x' Empty (Branch 'x' Empty Empty))] |
[Branch 'x' (Branch 'x' Empty (Branch 'x' Empty Empty)) (Branch 'x' (Branch 'x' Empty Empty) Empty),Branch 'x' (Branch 'x' (Branch 'x' Empty Empty) Empty) (Branch 'x' Empty (Branch 'x' Empty Empty))] |
||

− | </pre> |
+ | </haskell> |

+ | |||

+ | [[99 questions/Solutions/58 | Solutions]] |
||

− | Solution: |
||

− | <haskell> |
||

− | symCbalTrees = filter symmetric . cbalTree |
||

− | </haskell> |
||

== Problem 59 == |
== Problem 59 == |
||

− | <Problem description> |
+ | (**) Construct height-balanced binary trees |

+ | |||

+ | In a height-balanced binary tree, the following property holds for every node: The height of its left subtree and the height of its right subtree are almost equal, which means their difference is not greater than one. |
||

− | <pre> |
||

Example: |
Example: |
||

− | <example in lisp> |
||

− | Example in Haskell: |
+ | <pre> |

− | <example in Haskell> |
+ | ?- hbal_tree(3,T). |

+ | T = t(x, t(x, t(x, nil, nil), t(x, nil, nil)), t(x, t(x, nil, nil), t(x, nil, nil))) ; |
||

+ | T = t(x, t(x, t(x, nil, nil), t(x, nil, nil)), t(x, t(x, nil, nil), nil)) ; |
||

+ | etc......No |
||

</pre> |
</pre> |
||

− | Solution: |
+ | Example in Haskell: |

+ | |||

<haskell> |
<haskell> |
||

− | <solution in haskell> |
+ | *Main> take 4 $ hbalTree 'x' 3 |

+ | [Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' Empty (Branch 'x' Empty Empty)), |
||

+ | Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' (Branch 'x' Empty Empty) Empty), |
||

+ | Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' Empty Empty)), |
||

+ | Branch 'x' (Branch 'x' Empty (Branch 'x' Empty Empty)) (Branch 'x' Empty Empty)] |
||

</haskell> |
</haskell> |
||

− | <description of implementation> |
+ | [[99 questions/Solutions/59 | Solutions]] |

− | + | ||

+ | |||

== Problem 60 == |
== Problem 60 == |
||

− | <Problem description> |
+ | (**) Construct height-balanced binary trees with a given number of nodes |

+ | |||

+ | Consider a height-balanced binary tree of height H. What is the maximum number of nodes it can contain? |
||

+ | |||

+ | Clearly, MaxN = 2**H - 1. However, what is the minimum number MinN? This question is more difficult. Try to find a recursive statement and turn it into a function <hask>minNodes</hask> that returns the minimum number of nodes in a height-balanced binary tree of height H. |
||

+ | |||

+ | On the other hand, we might ask: what is the maximum height H a height-balanced binary tree with N nodes can have? Write a function <hask>maxHeight</hask> that computes this. |
||

+ | |||

+ | Now, we can attack the main problem: construct all the height-balanced binary trees with a given number of nodes. Find out how many height-balanced trees exist for N = 15. |
||

+ | |||

+ | Example in Prolog: |
||

<pre> |
<pre> |
||

− | Example: |
+ | ?- count_hbal_trees(15,C). |

− | <example in lisp> |
+ | C = 1553 |

+ | </pre> |
||

Example in Haskell: |
Example in Haskell: |
||

− | <example in Haskell> |
||

− | </pre> |
||

− | Solution: |
||

<haskell> |
<haskell> |
||

− | <solution in haskell> |
+ | *Main> length $ hbalTreeNodes 'x' 15 |

+ | 1553 |
||

+ | *Main> map (hbalTreeNodes 'x') [0..3] |
||

+ | [[Empty], |
||

+ | [Branch 'x' Empty Empty], |
||

+ | [Branch 'x' Empty (Branch 'x' Empty Empty),Branch 'x' (Branch 'x' Empty Empty) Empty], |
||

+ | [Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' Empty Empty)]] |
||

</haskell> |
</haskell> |
||

− | <description of implementation> |
+ | [[99 questions/Solutions/60 | Solutions]] |

− | + | ||

[[Category:Tutorials]] |
[[Category:Tutorials]] |

## Revision as of 14:09, 21 January 2012

This is part of Ninety-Nine Haskell Problems, based on Ninety-Nine Prolog Problems.

## 1 Binary trees

A binary tree is either empty or it is composed of a root element and two successors, which are binary trees themselves.

In Haskell, we can characterize binary trees with a datatype definition:

data Tree a = Empty | Branch a (Tree a) (Tree a) deriving (Show, Eq)

This says that a `Tree` of type `a` consists of either an `Empty` node, or a `Branch` containing one value of type `a` with exactly two subtrees of type `a`.

Given this definition, the tree in the diagram above would be represented as:

tree1 = Branch 'a' (Branch 'b' (Branch 'd' Empty Empty) (Branch 'e' Empty Empty)) (Branch 'c' Empty (Branch 'f' (Branch 'g' Empty Empty) Empty))

Since a "leaf" node is a branch with two empty subtrees, it can be useful to define a shorthand function:

`leaf x = Branch x Empty Empty`

Then the tree diagram above could be expressed more simply as:

tree1' = Branch 'a' (Branch 'b' (leaf 'd') (leaf 'e')) (Branch 'c' Empty (Branch 'f' (leaf 'g') Empty)))

Other examples of binary trees:

-- A binary tree consisting of a root node only tree2 = Branch 'a' Empty Empty -- An empty binary tree tree3 = Empty -- A tree of integers tree4 = Branch 1 (Branch 2 Empty (Branch 4 Empty Empty)) (Branch 2 Empty Empty)

## 2 Problem 54A

(*) Check whether a given term represents a binary tree

In Prolog or Lisp, one writes a predicate to do this.

Example in Lisp:

* (istree (a (b nil nil) nil)) T * (istree (a (b nil nil))) NIL

Non-solution:

Haskell's type system ensures that all terms of type

## 3 Problem 55

(**) Construct completely balanced binary trees

In a completely balanced binary tree, the following property holds for every node: The number of nodes in its left subtree and the number of nodes in its right subtree are almost equal, which means their difference is not greater than one.

Write a function cbal-tree to construct completely balanced binary trees for a given number of nodes. The predicate should generate all solutions via backtracking. Put the letter 'x' as information into all nodes of the tree.

Example:

* cbal-tree(4,T). T = t(x, t(x, nil, nil), t(x, nil, t(x, nil, nil))) ; T = t(x, t(x, nil, nil), t(x, t(x, nil, nil), nil)) ; etc......No

Example in Haskell, whitespace and "comment diagrams" added for clarity and exposition:

*Main> cbalTree 4 [ -- permutation 1 -- x -- / \ -- x x -- \ -- x Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' Empty (Branch 'x' Empty Empty)), -- permutation 2 -- x -- / \ -- x x -- / -- x Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' (Branch 'x' Empty Empty) Empty), -- permutation 3 -- x -- / \ -- x x -- \ -- x Branch 'x' (Branch 'x' Empty (Branch 'x' Empty Empty)) (Branch 'x' Empty Empty), -- permutation 4 -- x -- / \ -- x x -- / -- x Branch 'x' (Branch 'x' (Branch 'x' Empty Empty) Empty) (Branch 'x' Empty Empty) ]

## 4 Problem 56

(**) Symmetric binary trees

Let us call a binary tree symmetric if you can draw a vertical line through the root node and then the right subtree is the mirror image of the left subtree. Write a predicate symmetric/1 to check whether a given binary tree is symmetric. Hint: Write a predicate mirror/2 first to check whether one tree is the mirror image of another. We are only interested in the structure, not in the contents of the nodes.

Example in Haskell:

*Main> symmetric (Branch 'x' (Branch 'x' Empty Empty) Empty) False *Main> symmetric (Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' Empty Empty)) True

## 5 Problem 57

(**) Binary search trees (dictionaries)

Use the predicate add/3, developed in chapter 4 of the course, to write a predicate to construct a binary search tree from a list of integer numbers.

Example:

* construct([3,2,5,7,1],T). T = t(3, t(2, t(1, nil, nil), nil), t(5, nil, t(7, nil, nil)))

Then use this predicate to test the solution of the problem P56.

Example:

* test-symmetric([5,3,18,1,4,12,21]). Yes * test-symmetric([3,2,5,7,4]). No

Example in Haskell:

*Main> construct [3, 2, 5, 7, 1] Branch 3 (Branch 2 (Branch 1 Empty Empty) Empty) (Branch 5 Empty (Branch 7 Empty Empty)) *Main> symmetric . construct $ [5, 3, 18, 1, 4, 12, 21] True *Main> symmetric . construct $ [3, 2, 5, 7, 1] True

## 6 Problem 58

(**) Generate-and-test paradigm

Apply the generate-and-test paradigm to construct all symmetric, completely balanced binary trees with a given number of nodes.

Example:

* sym-cbal-trees(5,Ts). Ts = [t(x, t(x, nil, t(x, nil, nil)), t(x, t(x, nil, nil), nil)), t(x, t(x, t(x, nil, nil), nil), t(x, nil, t(x, nil, nil)))]

Example in Haskell:

*Main> symCbalTrees 5 [Branch 'x' (Branch 'x' Empty (Branch 'x' Empty Empty)) (Branch 'x' (Branch 'x' Empty Empty) Empty),Branch 'x' (Branch 'x' (Branch 'x' Empty Empty) Empty) (Branch 'x' Empty (Branch 'x' Empty Empty))]

## 7 Problem 59

(**) Construct height-balanced binary trees

In a height-balanced binary tree, the following property holds for every node: The height of its left subtree and the height of its right subtree are almost equal, which means their difference is not greater than one.

Example:

?- hbal_tree(3,T). T = t(x, t(x, t(x, nil, nil), t(x, nil, nil)), t(x, t(x, nil, nil), t(x, nil, nil))) ; T = t(x, t(x, t(x, nil, nil), t(x, nil, nil)), t(x, t(x, nil, nil), nil)) ; etc......No

Example in Haskell:

*Main> take 4 $ hbalTree 'x' 3 [Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' Empty (Branch 'x' Empty Empty)), Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' (Branch 'x' Empty Empty) Empty), Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' Empty Empty)), Branch 'x' (Branch 'x' Empty (Branch 'x' Empty Empty)) (Branch 'x' Empty Empty)]

## 8 Problem 60

(**) Construct height-balanced binary trees with a given number of nodes

Consider a height-balanced binary tree of height H. What is the maximum number of nodes it can contain?

Clearly, MaxN = 2**H - 1. However, what is the minimum number MinN? This question is more difficult. Try to find a recursive statement and turn it into a functionNow, we can attack the main problem: construct all the height-balanced binary trees with a given number of nodes. Find out how many height-balanced trees exist for N = 15.

Example in Prolog:

?- count_hbal_trees(15,C). C = 1553

Example in Haskell:

*Main> length $ hbalTreeNodes 'x' 15 1553 *Main> map (hbalTreeNodes 'x') [0..3] [[Empty], [Branch 'x' Empty Empty], [Branch 'x' Empty (Branch 'x' Empty Empty),Branch 'x' (Branch 'x' Empty Empty) Empty], [Branch 'x' (Branch 'x' Empty Empty) (Branch 'x' Empty Empty)]]