Last update: Tue Aug 13 02:15:26 MDT 2013
@Article{Creux:2000:TTC,
author = "Valery Creux",
title = "Tree Traversal in {C} without Recursion",
journal = j-CCCUJ,
volume = "18",
number = "7",
pages = "56--??",
month = jul,
year = "2000",
CODEN = "CCUJEX",
ISSN = "1075-2838",
bibdate = "Tue May 14 18:09:27 MDT 2002",
bibsource = "http://www.cuj.com/articles/2000/0007/0007toc.htm?topic=articles;
http://www.math.utah.edu/pub/tex/bib/cccuj2000.bib",
abstract = "If you can spare one bit of storage in each node, you
can traverse a tree without recursive function calls.",
acknowledgement = ack-nhfb,
}