CS301- Data Structures Assignment No.3 27 Dec 2011

Assignment No. 03
SEMESTER Fall 2011
CS301- Data Structures

Question:                                                                                                                                                    [20 marks]

Consider the following AVL Tree

1.    First  Insert 10

2.    Then Insert 95

3.    Then Insert 80

4.    Then Insert 77

Show the entire AVL tree after every insertion. You have to show complete steps in order to get full marks.

Solution;

Insert 10

AVL tree is balanced

Insert 95

Insert 80

Insert 77