hw2 written #1

From: Michelangelo Grigni (mic@mathcs.emory.edu)
Date: Fri Feb 17 2012 - 13:52:20 EST

• Next message: Michelangelo Grigni: "hw2 turnin"
• Previous message: Michelangelo Grigni: "hw1 program feedback"
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]

In written question #1, when it asks for an upper bound on N,
just give me the size of your example tree.   If you cannot
figure this out exactly, then give an upper bound on its size.
Smaller bounds are better, assuming they are correct.

If you cannot work out a formula for the general k case,
at least try some specific cases, like k=2,3,4.   For example,
there is a tree of size N=2, where some insertion uses
k=2 rotations.   What is the best N you can find for k=3?

• Next message: Michelangelo Grigni: "hw2 turnin"
• Previous message: Michelangelo Grigni: "hw1 program feedback"
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]

This archive was generated by hypermail 2.1.4 : Wed Apr 04 2012 - 17:34:17 EDT