Binary Search Tree — One-Time Tree Balancing 


RotateMethods.html  Java implementation of right and left rotations

Stout_Warren.htm      Slide for class use:  Stout and Warren's "tree_to_vine" method
DSW.doc
                   Class hand-out on the Day/Stout/Warren algorithm
Drozdek.pdf               Pages from Drozdek in the hand-out

Slide Set                    Example from the hand-out, as an HTML slide set

 Back 

Java code files

BSTnode.java           Class for a single binary search tree node — used by BST.java   [txt]
BST.java                   Full implementation:  add deletion and "pretty-printing"   [txt]
DSW.java                  public class DSW extends BST — adds the tree balancing behaviors   [txt]
DSWexercise.java     Main program to exercise the DSW functions   [txt]
DSW.jar                    Executable jar file from the above code
DSW.exe                   Directly executable under Windows — JSmooth exe wrapper


Enrichment Material

p902-stout.pdf           Local copy of Quentin F. Stout and Bette L. Warren's paper in the CACM (September 1986 Volume 29 Number 9, pp. 902-908).

Article on the DSW algorithm published to the December 2002 issue of the ACM SIGCSE newsletter (inroads)
(Association for Computer Machinery:  Special Interest Group on Computer Science Education)