Path: utzoo!utgpu!watmath!iuvax!mailrus!sharkey!atanasoff!hascall
From: hascall@atanasoff.cs.iastate.edu (John Hascall)
Newsgroups: comp.lang.c
Subject: Re: a tree question
Keywords: AVL, binary tree
Message-ID: <1329@atanasoff.cs.iastate.edu>
Date: 11 Aug 89 02:50:44 GMT
References: <421@ohs.UUCP>
Reply-To: hascall@atanasoff.cs.iastate.edu.UUCP (John Hascall)
Organization: Iowa State Univ. Computation Center
Lines: 17

In article <421@ohs.UUCP> bhil@ohs.UUCP (Brian T. Hill) writes:
}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.
 
    How so?

    Insertion (balancing) is O(log n) and requires only 2 extra bits
    per node (although almost everyone uses at least a byte).

    And half the time (roughly) no rebalancing is needed, with single
    and double rotation needed about one time in four each.

    If you insist on another method, how about B-trees?

John Hascall
ISU Comp Center