#!/usr/bin/perl -w

use BSTree;
use BSTNode;

$tree = BSTree->new;
@values = (10, 5, 15, 6, 20, 18, 25);
foreach (@values) {
	if ($tree->insert($_)) {
		print "Added $_ successfully.\n";
	} else {
		print "Couldn't add $_.\n";
	}
}
$tree->traverse;
@values = (10, 7, 18, 20, 13);
foreach (@values) {
	print (($tree->find($_) ? "Found $_" : "Didn't find $_") . "\n");
}
print "Minimum: " . $tree->root->minBelow->val . "\n";
print "Maximum: " . $tree->root->maxBelow->val . "\n";

print "Removing 5...\n";
$tree->remove(5);
print "Minimum: " . $tree->root->minBelow->val . "\n";
$tree->traverse;

print "Removing 20...\n";
$tree->remove(20);
$tree->traverse;

print "Removing the root, (" . $tree->root->val . ") cross your fingers...";
#$tree->remove($tree->root->val);
$tree->remove(10);
$tree->traverse;