sequence to FULLY test AVL tree implementation???

From: Nobody (nobody_at_cox.net)
Date: 12/28/04 

Date: Tue, 28 Dec 2004 01:06:36 -0800

I recently wrote an AVL tree class, I think its mostly working, but I want
to make sure. Assuming it uses integers, is there an insert/delete sequence
that is known to exercise every possible case of inserting and deleting?

Relevant Pages