One-time binary search tree balancing: the Day/Stout/Warren (DSW) algorithm

Authors:
Timothy J. Rolfe
Affiliations:
Eastern Washington University, Cheney, Washington
Venue:
ACM SIGCSE Bulletin
Year:
2002

Citing 3
Cited 0

Tree rebalancing in optimal time and space

Communications of the ACM
Algorithms, data structures, and problem solving with C++

Algorithms, data structures, and problem solving with C++
FORTRAN Techniques with Special Reference to Non-Numerical Applications

FORTRAN Techniques with Special Reference to Non-Numerical Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A. Colin Day proposed, and Quentin F. Stout and Bette L. Warren modified, an algorithm (the Day/Stout/Warren or DSW algorithm) that, in O(N) time and O(1) space, transforms an arbitrary binary search tree into a degenerate tree, and from that generates the most balanced possible binary search tree.