FUNCTIONAL PEARLS Maximum marking problems
Here are two puzzles for you to solve. First, consider the binary tree in figure 1. Take a pencil (I am assuming that this is your personal copy of JFP!) and mark some of the nodes in such a way that the sum of the values of marked nodes is as large as possible. The catch is that you cannot mark all...
| Format: | Journal article |
|---|---|
| Published: |
Cambridge University Press
2001
|
| Subjects: |