Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!wuarchive!uwm.edu!bionet!agate!usenet.ins.cwru.edu!ysub!psuvm!hcm100
From: HCM100@psuvm.psu.edu (Hans C. Masing)
Newsgroups: comp.lang.pascal
Subject: Binary Search Tree balancing scheme wanted...
Message-ID: <91116.093003HCM100@psuvm.psu.edu>
Date: 26 Apr 91 13:30:03 GMT
Organization: Penn State University
Lines: 23

Hi all-

     I make it to c.l.p about once every eight months, and I'm due for an
aniversary posting.  I'm looking for a procedure that will balance out a
binary search tree (BST from here on out).  Preferablyone that will work
with large BST's and balance them rather quickly.  Also, if available, a
procedure that will check a BST to see if it NEEDS balancing.

     I think that I have a working procedure that I wrote to determine if
a BST needs to be balanced (rather simple recursive algorithm), but I would
like to see how others handled it.

     Please send to my e-mail address.  I will be happy to post the most
efficient procedures.  :-)

     Thanks a maxint...

     Hans C. Masing


    /_/ _            /| /|  _      '         | HCM100 @ PSUVM.psu.edu
  _/ /_(_|_/|/_/)_  / |/ |_(_|_/)_/_/|/_(_)  | Hans C. Masing
                                      (__/