First, non-recursive depth-first searches,
using a stack.
DFS Tree From Node 47 (ME) (larger picture:
here) DFS Tree From Node 3 (WA) (larger picture:
here) DFS Tree From Node 19 (MO (larger picture:
here)
Second, recursive depth-first searches,
using a recursive call.
(Top number is the "d" field, the "time detected", and
bottom number is the "f" field, the "time finished".
See your text, pages 603-606.)
DFS Tree From Node 47 (ME) (larger picture:
here) DFS Tree From Node 3 (WA) (larger picture:
here) DFS Tree From Node 19 (MO) (larger picture:
here)
Depth-first Searchs of a Binary Tree, from Root.
DFS of Binary Tree (recursive), from root (larger picture:
here)
DFS of Binary Tree (non-recursive), from root (larger picture:
here)
Revision date:2011-10-27.
(Please use ISO 8601,
the International Standard Date and Time Notation.)
