Entry Hatter:1984:AGN from compj1980.bib
Last update: Sat Jan 6 02:03:49 MST 2018
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{Hatter:1984:AGN,
author = "D. J. Hatter",
title = "Algorithm 116: a generalized non-recursive binary tree
traversal algorithm",
journal = j-COMP-J,
volume = "27",
number = "2",
pages = "178--179",
month = may,
year = "1984",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/27.2.178",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Mon Jul 26 14:07:48 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_02/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_02/tiff/178.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_27/Issue_02/tiff/179.tif",
acknowledgement = ack-nhfb,
classcodes = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Systems and Computing, North East London
Polytech., Dagenham, UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "algebraic string; algorithm theory; binary; endorder
tree traversal; postorder tree traversal; preorder tree
traversal; traversal path; tree traversal; trees
(mathematics)",
treatment = "T Theoretical or Mathematical",
}
Related entries
- algebraic,
27(4)301,
28(1)59,
28(2)142,
28(2)154,
29(3)261,
29(5)416,
30(4)316,
31(3)229,
31(4)313,
32(2)122,
32(5)413
- binary,
23(3)248,
23(3)269,
23(4)332,
24(1)42,
25(1)140,
25(1)158,
25(3)316,
25(4)471,
26(2)106,
26(2)154,
26(2)187,
26(3)193,
28(4)417,
28(4)426,
28(5)538,
29(1)36,
29(2)103,
29(2)171,
29(4)368,
30(2)176,
30(4)308,
30(6)541,
30(6)565,
31(2)141,
31(4)330,
31(6)564,
31(6)565,
32(1)45,
32(1)63,
32(1)68,
32(1)76,
32(3)246,
32(5)470
- generalized,
27(3)278,
29(3)193,
30(2)157,
31(4)325
- mathematics,
23(2)161,
23(3)248,
23(3)256,
23(4)332,
25(1)158,
25(2)235,
25(2)239,
25(2)257,
26(2)97,
26(2)106,
26(2)188,
26(3)193,
26(3)205,
26(3)224,
27(2)184,
27(3)218,
27(3)225,
27(4)368-1,
28(1)73,
28(2)105,
28(3)313,
28(4)417,
28(4)426,
28(4)433,
28(4)439,
28(5)538,
29(1)36,
29(1)52,
29(1)76,
29(2)171,
29(2)176,
29(6)564,
30(3)268,
30(3)277,
30(3)282,
30(4)355,
30(5)433,
30(6)569,
31(1)61,
31(1)65,
31(3)269,
31(4)330,
31(4)353,
31(4)364,
31(6)557,
31(6)564,
31(6)567,
32(1)68,
32(1)76,
32(3)281,
32(4)374,
32(5)470,
32(5)474,
32(6)571
- path,
23(2)161,
23(2)188,
23(3)207,
29(5)423,
29(6)553,
30(1)43,
30(1)77,
31(1)41,
32(1)24,
32(1)68,
32(3)194,
32(3)228
- string,
23(1)37,
25(1)93,
25(1)114,
26(3)205,
29(6)486,
30(2)149,
32(3)228
- traversal,
23(4)332,
25(3)397,
28(4)426,
31(3)269,
31(4)358,
32(1)76