A NOTE ON GENERATING BINARY-TREES IN A-ORDER AND B-ORDER

被引：50

作者：

PALLO, J

RACCA, R

机构：

来源：

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1985年 / 18卷 / 01期

关键词：

D O I：

10.1080/00207168508803477

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：27 / 39

页数：13

共 18 条

[1] CONSTANT TIME GENERATION OF ROOTED TREES [J].

BEYER, T ;

HEDETNIEMI, SM .

SIAM JOURNAL ON COMPUTING, 1980, 9 (04) :706-712

[2] ON THE GENERATION OF BINARY-TREES BY B-SEQUENCES [J].

BONNIN, A ;

PALLO, JM .

DISCRETE MATHEMATICS, 1984, 51 (02) :111-117

[3] ENUMERATIONS OF ORDERED TREES [J].

DERSHOWITZ, N ;

ZAKS, S .

DISCRETE MATHEMATICS, 1980, 31 (01) :9-28

[4]

ER MC, 1983, COMPUT J, V26, P205, DOI 10.1093/comjnl/26.3.205

[5]

GUPTA UI, 1983, J ALGORITHM, V4, P51, DOI 10.1016/0196-6774(83)90034-2

[6] NUMBERING SYSTEM FOR BINARY TREES [J].

KNOTT, GD .

COMMUNICATIONS OF THE ACM, 1977, 20 (02) :113-115

[7]

Knuth D. E., 1969, ART COMPUTER PROGRAM, V1

[8] GENERATION OF BINARY-TREES [J].

PROSKUROWSKI, A .

JOURNAL OF THE ACM, 1980, 27 (01) :1-2

[9] GENERATION OF BINARY TREES FROM BALLOT SEQUENCES [J].

ROTEM, D ;

VAROL, YL .

JOURNAL OF THE ACM, 1978, 25 (03) :396-404

[10]

Rotem D., 1975, Information Processing Letters, V4, P58, DOI 10.1016/0020-0190(75)90002-2

← 1 2 →