AVL Tree Homework 7 - Data Structures | CS 225, Assignments of Data Structures and Algorithms

Material Type: Assignment; Professor: Heeren; Class: Data Structures; Subject: Computer Science; University: University of Illinois - Urbana-Champaign; Term: Fall 2007;

Typology: Assignments

Pre 2010

Uploaded on 03/10/2009

koofers-user-n7i
koofers-user-n7i 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS225 Headbangers
, #7
NetId:
1. Consider each of the following binary trees. Mark every unbalanced node (remember the definition of a balanced
node from AVL tree definition). Finally, for every tree indicate whether it is an AVL tree or not.
1

Partial preview of the text

Download AVL Tree Homework 7 - Data Structures | CS 225 and more Assignments Data Structures and Algorithms in PDF only on Docsity!

CS225 Headbangers ,

NetId:

  1. Consider each of the following binary trees. Mark every unbalanced node (remember the definition of a balanced node from AVL tree definition). Finally, for every tree indicate whether it is an AVL tree or not.