Day-Stout-Warren algorithm
Day-Stout-Warren algorithm proper noun: a method for efficiently balancing a binary search tree.
Proper noun
the Day-Stout-Warren algorithm
- A method for efficiently balancing a binary search tree.
Origin of Day-Stout-Warren algorithm
Designed by Quentin F. Stout and Bette Warren in a 1986 paper, based on work done by Colin Day in 1976.
Questions about Day-Stout-Warren algorithm
- What does Day-Stout-Warren algorithm mean?
- Day-Stout-Warren algorithm means a method for efficiently balancing a binary search tree.
- What part of speech is Day-Stout-Warren algorithm?
- Day-Stout-Warren algorithm is a proper noun.
Words near Day-Stout-Warren algorithm in the dictionary
Source and license
Adapted from Wiktionary: Day-Stout-Warren algorithm (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Day-Stout-Warren algorithm.” Word.ws, https://word.ws/day-stout-warren_algorithm. Based on Wiktionary, CC BY-SA 4.0.
