AN EMPIRICAL-STUDY OF INSERTION AND DELETION IN BINARY SEARCH-TREES

被引：11

作者：

EPPINGER, JL

机构：

[1] Carnegie-Mellon Univ., Pittsburgh,PA, United States

来源：

关键词：

This research was sponsored in part by the Office of Naval Research under contract N00014-76-C-0370;

D O I：

10.1145/358172.358183

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：663 / 669

页数：7

共 9 条

[1]

Hibbard T. N, 1962, J ACM, V9, P13

[2] TRIVIAL ALGORITHM WHOSE ANALYSIS ISNT [J].

JONASSEN, AT ;

KNUTH, DE .

[3]

KNOTT GD, 1975, STANCS75491 STANF U

[4]

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

[5] DELETIONS THAT PRESERVE RANDOMNESS [J].

KNUTH, DE .

[6]

KNUTH DE, 1975, ART COMPUTER PROGRAM, V3

[7]

Knuth Donald E, 1968, ART COMPUTER PROGRAM, V1

LEWIS, TG ;

PAYNE, WH .

[9]

ROSS SM, 1970, APPLIED PROBABILITY