Day-Stout-Warren algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Etymology[edit]

Designed by Quentin F. Stout and Bette Warren in a 1986 paper, based on work done by Colin Day in 1976.

Proper noun[edit]

the Day-Stout-Warren algorithm

  1. (computing theory) A method for efficiently balancing a binary search tree.