for testing and deploying your application
for finding and fixing issues
for empowering human code reviews
<?php
/**
* DataStructures for PHP
*
* @link https://github.com/SiroDiaz/DataStructures
* @copyright Copyright (c) 2017 Siro Díaz Palazón
* @license https://github.com/SiroDiaz/DataStructures/blob/master/README.md (MIT License)
*/
namespace DataStructures\Trees;
use DataStructures\Trees\BinaryTreeAbstract;
use DataStructures\Trees\Nodes\AVLNode;
* AVLTree
* This class is an implementation of a AVL tree. It has as main feature that access,
* insertion and deletion is O(log n). This is like a BST but it has a slightly difference
* in nodes: contains a height attribute, used to detect when is needed to rebalance the
* tree to keep the O(log n).
* @author Siro Diaz Palazon <[email protected]>
class AVLTree extends BinaryTreeAbstract {
public function createNode($key, $data, $parent = null, $left = null, $right = null) {
return new AVLNode($key, $data, $parent, $left, $right);
}
SiroDiaz /
DataStructures
