searching trees (AVL, 2-3-4 and red-black trees) 
Author Message
 searching trees (AVL, 2-3-4 and red-black trees)


Hi,

I am currently programming in Smalltalk 80 and I encounter several problems.

The purpose of my work is to display and browse different kinds of searching
trees, such as AVL-trees, 2-3-4 trees and red-black trees.

I would be very glad if you could give me any algorithms for rotating trees,
inserting and deleting elements. An object oriented approach would be fine.
Book references will also be appreciated...

Please, if you have any answers, mail them to

           ,,,
          (o o)
 +----oOO--(=)--OOo-------------------------------------------------+
#|                Association des Eleves du MIAIF                   |#
#|       Magistere d'Informatique Appliquee d'Ile de France         |#
#|,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,|#
#|    __o                    __o        __o                   `o'   |#
#|   -\<,                   -\<,       -\<,                   -|\,  |#
#| (*)/(*)             ..:(*)/(*)  ..(*)/(*)                (*)I(*) |#
#|==================================================================|#

#| 45, rue des Saints Peres     |  Tel: 42.86.22.35                 |#
#| 75006 Paris                  |                                   |#
 +------------------------------------------------------------------+

Thank you very much indeed.

Emmanuel.



Tue, 25 Jun 1996 16:36:38 GMT  
 
 [ 1 post ] 

 Relevant Pages 

1. AVL and red-black trees

2. need code for red-black binary search tree

3. AVL Tree,Binary Tree,Sorting..

4. Red Black Tree - delete function

5. Program to create Red-Black Trees

6. Red-Black tree in PROLOG

7. Red Black Tree in PROLOG

8. red-black trees in fortran

9. Red - black trees

10. Red-Black-Trees and Fortran 2003 Features

11. Red-Black trees

12. Self-Adjusting Binary Search Trees (Splay Trees)

 

 
Powered by phpBB® Forum Software