PHP OOP implementation of Red Black Tree. You can found information about this kind of binary search tree on wikipedia.
Add library to your composer.json require:
{
"require": {
"jihel/library-rbtree": "dev-master",
}
}
or
php composer.phar require jihel/library-rbtree
use Jihel\Library\RBTree\Tree as Tree;
$tree = new Tree();
$node = new Jihel\Library\RBTree\Node(1, 'My value');
$tree->insert($node);
$tree->remove($node);
Please note that the var $node is not deleted, the object still exist but is detached from the tree.
$node = $tree->find(1);
$next = $tree->findRelative($node, Jihel\Library\RBTree\Model\NodeInterface::POSITION_RIGHT);
// or
$next = $tree->findSuccessor($node);
$list = $tree->enumerate(1, 12);
You can look at exemples for a simple implementation with integer nodes :
I inspired from the work of Gokce Toykuyu from the MIT. See his implementation
There is also some youtube video of a RB Tree at work who might interest you :
Thanks to me for giving my free time doing class for lazy developers.
You can access read CV here