Quiz 100% Result
  • Cyberian's Gold

    Re: CS301 Assignment 3 Solution and Discussion

    Assignment No. 03  
    

    SEMESTER FALL 2020
    CS301- Data Structures Total Marks: 20
    Due Date: 21/01/2021
    Instructions
    Please read the following instructions carefully before solving & submitting assignment:
    It should be clear that your assignment will not get any credit (zero marks) if:
    o The assignment is submitted after due date.
    o The submitted assignment is other than .doc/.docx file.
    o The submitted assignment does NOT open or file is corrupted.
    o The assignment is copied (from other student or ditto copy from handouts or internet).
    Uploading instructions

    o For clarity and simplicity, you are required to Upload/Submit only .doc/.docx file.

    Objective
    The objective of this assignment is:
    o Binary Search trees
    o AVL trees
    o Rotation cases of AVL trees
    o Balancing Factor of trees

    For any query about the assignment, contact at [email protected]
    GOOD LUCK
    Marks: 20

    Problem Statement:

    You are required to construct AVL tree from the following data:

    15 ,18 ,12, 8, 54, 5, 14, 13, 9, 61, 20, 17, 21

    Solution Guidelines:

    1. You need to insert these data items one by one starting from the data item 15 in the same order in which they have written above.
    2. Show and perform necessary rotations where needed.
    3. In Solution show only the final AVL tree and only those steps in which rotation is applied.

    Note: If you show only final tree and do not show the rotation steps then your marks will be deducted.
    Lectures Covered: This assignment covers Lecture # 15-26
    Deadline: Your assignment must be uploaded/submitted at or before January 21 , 2021

  • Cyberian's Gold

  • Cyberian's Gold

50% Off on Your FEE Join US!

Quiz 100% Result If you want to know how you can join us and get 50% Discout on your FEE ask Cyberian in Chat Room! Quiz 100% Result Quiz 100% Result
| |