3009	 Insertions and Deletions In One-Sided Height-Balanced Trees	 Recently Hirschberg has established that insertions into one-sided height-balanced trees can be done in log N steps. It is proved here that deletions can also be performed in log N steps which answers the open problem posed by Hirschberg. AVL trees balanced trees binary search dynamic balancing
