Randomness Preserving Deletions on Special Binary Search Trees

Authors:
Michaela Heyer
Affiliations:
Department of Computer Science, National University of Ireland, Cork, Ireland
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 7
Cited 0

Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
An introduction to the analysis of algorithms

An introduction to the analysis of algorithms
Randomized binary search trees

Journal of the ACM (JACM)
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting

Journal of the ACM (JACM)
Deletion in binary storage trees.

Deletion in binary storage trees.
Deletions That Preserve Randomness

IEEE Transactions on Software Engineering
A Modular Calculus for the Average Cost of Data Structuring

A Modular Calculus for the Average Cost of Data Structuring

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deletions in binary search trees are difficult to analyse as they are not randomness preserving. We will present a new kind of tree which differs slightly from the standard binary search tree. It will be referred to as an ordered binary search tree as it stores a history element in its nodes, which provides information about the order in which the nodes were inserted. Using this extra information it is possible to design a new randomness preserving and order preserving deletion algorithm.