Xref: utzoo comp.lang.c:20553 sci.math:7535 Path: utzoo!attcan!uunet!iconsys!ohs!bhil From: bhil@ohs.UUCP (Brian T. Hill) Newsgroups: comp.lang.c,sci.math Subject: a tree question Keywords: AVL, binary tree Message-ID: <421@ohs.UUCP> Date: 9 Aug 89 14:39:10 GMT Followup-To: comp.lang.c Organization: Orem High School, Orem, Utah Lines: 16 Does anyone have a good alternative to the AVL method of balancing binary trees? It seems to me that the AVL method is wasteful of both time and space. Any solutions will be appreciated. -------------------------------------------------------------------------- /"""\ Kerr's Three Rules for a Successful College: |^ ^| Have plenty of football for the alumni, sex for the students, @|O O|@ and parking for the faculty. | - | \_/ %-+-% # _/ \_ --Brian T. Hill (...uunet!iconsys!ohs!bhil) (bhil@ohs.uucp) --------------------------------------------------------------------------