12 th Experiment AVL- TREE

ALGORITHM FOR AVL TREES:

Step 1 : start

Step 2: read the elements of the tree to insert or delete

Step 3: create the class avltree with its object t

Step 4: to insert an element, call the member function insert() through its object

Step 5: to delete an element, call the member function delete() through its object

Step 6: to display the tree, call the member function print() through its object.

Step 7: stop.

------------------------------------------------------------------------------------------------------------------------------------------
                                                              FLOWCHARTS
----------------------------------------------------------------------------------------------------------------------------------------

---------------------------------------------------------------------------------------------------------------------------------------

C++ IMPLEMENTATION

--------------------------------------------------------------------------------------------------------------------------------------

soon uploaded....