AVL Rotations

The following links explain and show illustrations of the single and double rotations we discussed today:

http://209.237.84.181:7600/index.php/AVL_Trees
(Note that in this link the balance factor is computed as: right height - left height, which is the opposite of what we used in class).

http://pages.cs.wisc.edu/~paton/readings/liblitVersion/AVL-Tree-Rotations.pdf

Bittawfeeq,

Tutorial Sessions

This is a note from our TAs Maryam and Raghda:

"I Just want to confirm that next Tuesday will be a session to review the basic of

BST and on Wednesday the session will be about solving questions about BST too.

The both sessions will be in 204 at (2:00-4:00)pm."

Iterative Tree Traversals

We have seen in class the iterative version of the pre-order traversal. The following two links discuss how post-order and in-order traversals can be implemented iteratively:

http://leetcode.com/2010/04/binary-search-tree-in-order-traversal.html

http://leetcode.com/2010/10/binary-tree-post-order-traversal.html

Assignment 3

Assignment 3 is ready, check it out in the assignment tab.

Enjoy!

Second Exam Solutions

You can find in the following cpp file solutions for the list, queue and tree programming questions.

ExamSolutions.cpp