Self-adjusting binary search trees

Author:

Sleator Daniel Dominic1,Tarjan Robert Endre1

Affiliation:

1. AT&T Bell Laboratories, Murray Hill, NJ

Abstract

The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an n -node splay tree, all the standard search tree operations have an amortized time bound of O (log n ) per operation, where by “amortized time” is meant the time per operation averaged over a worst-case sequence of operations. Thus splay trees are as efficient as balanced trees when total running time is the measure of interest. In addition, for sufficiently long access sequences, splay trees are as efficient, to within a constant factor, as static optimum search trees. The efficiency of splay trees comes not from an explicit structural constraint, as with balanced trees, but from applying a simple restructuring heuristic, called splaying , whenever the tree is accessed. Extensions of splaying give simplified forms of two other data structures: lexicographic or multidimensional search trees and link/cut trees.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference37 articles.

1. algorithm for the organization of information;ADEL'SON-VEL'SKII G.M.;Soy. Math. Dokl.,1962

2. Self-Organizing Binary Search Trees

3. BAYER R. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta inf i (1972) 290-306. BAYER R. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta inf i (1972) 290-306.

Cited by 680 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Projected fuzzy c-means clustering algorithm with instance penalty;Expert Systems with Applications;2024-12

2. Online computation with untrusted advice;Journal of Computer and System Sciences;2024-09

3. Refining HPCToolkit for application performance analysis at exascale;The International Journal of High Performance Computing Applications;2024-08-30

4. Algorithms for Densest Subgraphs of Vertex-Weighted Graphs;Mathematics;2024-07-14

5. Competitive Channel-Capacity;IEEE Transactions on Information Theory;2024-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3