Sedgewick` Algorithms

bk.adda/Sedgewick` Algorithms

10.5:

adda/parse.tree:

. a parse tree is the usual name for what I called an etree (expression tree)

adda/forest:

. a forest is a tree that is not binary;

[10.9:

eg, in the universe of acyclic graphs

lists have only 2 edges, trees 3, and forests > 3 .

. forests can be impl'd with trees

by having one edge leading to the next node extension,

rather than a 2nd child . ]

any node in a forest:

. if a tree has 2 way edges

then any node can be root

but it becomes a forest .

10.6: adda/breadth-first search:

. breadth-first search is done by a

non-recursive pre-order traversal

but where the algorithm replaces the usual stack access

with a queue .