RANKING AND UNRANKING OF AVL-TREES

被引：11

作者：

LI, LW ^{[1
]}

机构：

[1] NANKAI UNIV,DEPT COMP SCI,TIANJIN,PEOPLES R CHINA

来源：

SIAM JOURNAL ON COMPUTING | 1986年 / 15卷 / 04期

关键词：

D O I：

10.1137/0215073

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：1025 / 1035

页数：11

共 12 条

[1]

Aho A., 1976, DESIGN ANAL COMPUTER

[2]

[Anonymous], 1962, SOV MATH DOKL

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

BEYER, T ;

HEDETNIEMI, SM .

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

[4] RANKING AND UNRANKING OF 2-3 TREES [J].

GUPTA, U ;

LEE, DT ;

WONG, CK .

SIAM JOURNAL ON COMPUTING, 1982, 11 (03) :582-590

[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., 1973, ART COMPUTER PROGRAM

[8] GENERATING BINARY TREES LEXICOGRAPHICALLY [J].

RUSKEY, F ;

HU, TC .

SIAM JOURNAL ON COMPUTING, 1977, 6 (04) :745-758

[9]

RUSKEY F, 1978, SIAM J COMPUT, V7, P706

[10] RANKING AND LISTING ALGORITHMS FOR K-ARY TREES [J].

TROJANOWSKI, AE .

SIAM JOURNAL ON COMPUTING, 1978, 7 (04) :492-509

← 1 2 →