View more random threads:
- CS701 Theory of Computation Assignment No. 1 Fall 2014 7th...
- MTH202 Discrete Mathematics Assignment No 1 Fall Semester...
- MGT503 Principles of Management Assignment 1 May 17,2010
- CS614 Data Warehousing Assignment No 4 Discussion Spring...
- CS301 Data Structure Assignments No.4 Solution Fall 2014...
- CS604 Operating Systems Assignment No.01 Solution and...
- HRM627 Human Resource Development Assignment No. 2 Fall...
- Check Online MGt705 Assignment 1 Solution and Discussion...
- Leadership and Team Management (MGMT623) Assignment No. 1...
- Assignment No. 5 MTH 301 (Spring 2010)
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
There are currently 1 users browsing this thread. (0 members and 1 guests)