Phpml\Tree\Node\BinaryNode

Complexity

Total Complexity

16

Size/Duplication

Total Lines	72
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

10 Methods

Rating	Name	Duplication	Size	Complexity
A	left()	0	3	1
A	height()	0	3	3
A	detachRight()	0	5	2
A	right()	0	3	1
A	attachRight()	0	4	1
A	attachLeft()	0	4	1
A	balance()	0	3	3
A	setParent()	0	3	1
A	detachLeft()	0	5	2
A	parent()	0	3	1

<?php

declare(strict_types=1);

namespace Phpml\Tree\Node;

use Phpml\Tree\Node;

class BinaryNode implements Node
{
    /**
     * @var self|null
     */
    private $parent;

    /**
     * @var self|null
     */
    private $left;

    /**
     * @var self|null
     */
    private $right;

    public function parent(): ?self
    {
        return $this->parent;
    }

    public function left(): ?self
    {
        return $this->left;
    }

    public function right(): ?self
    {
        return $this->right;
    }

    public function height(): int
    {
        return 1 + max($this->left !== null ? $this->left->height() : 0, $this->right !== null ? $this->right->height() : 0);
    }

    public function balance(): int
    {
        return ($this->right !== null ? $this->right->height() : 0) - ($this->left !== null ? $this->left->height() : 0);
    }

    public function setParent(?self $node = null): void
    {
        $this->parent = $node;
    }

    public function attachLeft(self $node): void
    {
        $node->setParent($this);
        $this->left = $node;
    }

    public function detachLeft(): void
    {
        if ($this->left !== null) {
            $this->left->setParent();
            $this->left = null;
        }
    }

    public function attachRight(self $node): void
    {
        $node->setParent($this);
        $this->right = $node;
    }

    public function detachRight(): void
    {
        if ($this->right !== null) {
            $this->right->setParent();
            $this->right = null;
        }
    }
}