CS301-Data Structures Assignment No.3 Discussion And Solution Fall 2013 Due Date 13/01/2014

Question 1: Marks 5
Construct the binary search tree from following data.
50, 16, 40, 33, 55, 31, 57, 68, 77, 52, 19, 66
Question 2:
Construct the AVL tree from the data given in question 1. Show all rotation steps. Marks 15
Solution Guidelines:
Show only final tree in question 1.
In AVL tree show all rotation steps.
If rotation is not required then you can add multiple notes in one step.
When any node needs rotation then show balance of unbalanced nodes during rotation.
You don’t need to write code in any question of this assignment.
Lectures Covered: This assignment covers Lectures # 11- 23
Deadline: Your assignment must be uploaded / submitted on / before, Monday 13 January, 2014.


Sponsored Links