Solutions of Theory of Algorithms assignment 13.2-2

Solutions of Theory of Algorithms assignment 13.2-2 - has...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Solutions of Theory of Algorithms Assignment 6 Exercise 13.2-2 To make any rotation (left or right), we need at least two nodes in the tree. If the tree
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: has only one node (the root), we can't make a rotation at all. So, in general, if the tree consists of n nodes, we can have n-1 rotations....
View Full Document

This note was uploaded on 11/09/2010 for the course CS 11841 taught by Professor Dr.ayman during the Spring '09 term at Alexandria University.

Ask a homework question - tutors are online