Assignments | Class Photo | Computing Resources | Course Home | Lab Hours/Tutoring | Schedule | Submit

Saint Louis University

Computer Science 180
Data Structures

Michael Goldwasser

Spring 2009

Dept. of Math & Computer Science

Homework Assignment 07

Balanced Trees

Contents:


Overview

Topic: Balanced Trees
Related Reading: Ch. 11.1, 11.2, 11.5
Due: Friday, 1 May 2009, 10:00am

Please make sure you adhere to the policies on academic integrity.


Problems to be Submitted (20 points)

  1. (5 points)

    Draw the AVL tree that results after inserting the sequence of elements 1, 2, 3, 4, 5, 6, in that order.

  2. (5 points)

    Continuing where you left off with the preceding problem, show the final result after the additional insertions 7, 8, 9, 10.

  3. (5 points)

    Draw the 2-3-4 tree that results after inserting the sequence of elements 1, 2, 3, 4, 5, 6, in that order.

  4. (5 points)

    Continuing where you left off with the preceding problem, show the final result after the additional insertions 7, 8, 9, 10.


Michael Goldwasser
CSCI 180, Spring 2009
Last modified: Sunday, 30 November 2008
Assignments | Class Photo | Computing Resources | Course Home | Lab Hours/Tutoring | Schedule | Submit