lect08a

- continue/finish: processing anc-trees (lect06c-.ss):
  functions that take in an anc-tree and return ...
     - an int, 
     - a new tree,
     - and a list.
  Discuss 'append'.
- A note on memory representation/sharing, for a list of a tree's nodes.
- Btw: old skool: 'car', 'cdr'; 'cddar'
  (representing aggregate types as lists of fixed size, instead of structs)
- Passing functions in Java: see the .java mentioned in lect07c.ss

home—info—lectures—exams—hws—archive

©2009, Ian Barland, Radford University
Last modified 2009.Oct.21 (Wed) Please mail any suggestions
(incl. typos, broken links)
to iba�rlandrad�ford.edu