SiroDiaz / DataStructures

     * @return DataStructures\Trees\Nodes\BinaryNodeInterface|null the minimum node or

     *  null if the tree is empty.

     */

    public function deleteMin(BinaryNodeInterface $node = null) {

        $node = $this->getMinNode($node ?? $this->root);

        if($node !== null) {

            $this->_delete($node);

        }

        return $node;

    }

    /**

     * Deletes the node with the maximum key and returns it. The most right and more bottom.

     * @return DataStructures\Trees\Nodes\BinaryNodeInterface|null the maximum node or

     *  null if the tree is empty.

     */

    public function deleteMax(BinaryNodeInterface $node = null) {

        $node = $this->getMaxNode($node ?? $this->root);

        if($node !== null) {

            $this->_delete($node);

        }

        return $node;

    }

    /**

     * Deletes the node with the maximum key and returns it. The most right and more bottom.