Posted by hussein on August 01, 1999 at 16:08:05:
In Reply to: problem 5.6 posted by nunzio on August 01, 1999 at 13:17:53:
: Has anyone worked problem 5.6 from the text. I have attempted it with little
: success. I have tried to use a queue to hold information about nodes and recursion
: to traverse the tree but can't seem to get the right output. Any suggestions?
do a breadth-first-search as if it was a graph.
use a queue and apply the non-recursive algorithm on p201 of the text ... substituting an iteration over the children for the iteration over edges at each node ...
---
hussein