Last update: Tue Aug 13 02:15:26 MDT 2013
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@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,
}
Related entries
- bit,
18(8)26,
18(8)61,
18(8)71,
18(12)10,
18(12)54,
19(3)96,
19(5)58,
20(2)z-2
- C,
18(1)z-8,
18(1)z-9,
18(2)85,
18(4)73,
18(7)60,
18(8)83,
18(10)10,
18(10)49,
18(11)55,
18(11)80,
18(12)65,
19(1)52,
19(2)z,
19(2)z-6,
19(4)z-6,
19(5)52,
19(6)33,
19(10)46,
19(11)z-8,
19(12)z-12,
20(1)z-1,
20(2)z-4,
20(2)z-5,
20(3)z-6,
20(5)z
- function,
18(2)44,
18(10)32,
19(2)z-3,
19(3)42,
19(5)8,
19(6)22,
19(7)65,
19(8)24,
19(9)z,
20(6)37,
20(7)47
- one,
18(1)z-10,
18(2)36,
18(3)89,
18(4)40,
18(6)z-4,
18(6)z-6,
18(9)70,
18(9)94,
18(11)80,
18(12)10,
18(12)46,
19(2)z-8,
19(3)67,
19(4)z-3,
19(4)z-4,
19(7)10,
19(8)46,
19(9)z-4,
19(10)57,
19(12)z-10,
19(12)z-13,
20(1)z-5,
20(1)z-7
- recursion,
18(12)32
- spare,
18(12)73
- tree,
18(1)z-4