"Iterator traverses a tree in breadth-first order.
The first argument should be the tree root; visitable should be an
iterable with all searchable nodes; children should be a function
which takes a node and
Comp 122, Fall 2004
Longest Common Subsequence
Problem: Given 2 sequences, X = x1,.,xm and Y = y1,.,yn , find a common subsequence whose length is maximum. springtime printing ncaa tournament north carolina basketball krzyzewski