<?php
/**
 * User:@DennisRitche
 */

require_once "Node.php";
require_once "NodeComparator.php";
require_once "BinaryTree.php";

class  IntComparator implements NodeComparator
{
    /**
     * compare two node
     * @param Node $a
     * @param Node $b
     * @return int
     */
    public function compare(Node $a, Node $b)
    {
        $ret = $a->getValue() - $b->getValue();
        return $ret;
    }
}

$tree = new BinaryTree(new IntComparator());
$to_insert = [100, 20, 1, 34, 230, 78, 349, 289, 89, 45, 30, 8];
foreach ($to_insert as $item) {
    $tree->insert($item);
}

//$tree->delete(8);
//$tree->delete(45);
//$tree->delete(1);
//$tree->delete(349);
//$tree->delete(78);
//$tree->delete(34);
$tree->delete(100);
$tree->debug(function (Node $node) {
    echo $node->getValue() . "\n";
});