Seboettg\Forest\BinaryTree\BinaryNode

Complexity

Total Complexity

13

Size/Duplication

Total Lines	109
Duplicated Lines	0 %

Test Coverage

Coverage

93.1%

Importance

Changes

0

11 Methods

Rating	Name	Duplication	Size	Complexity
A	getItem()	0	3	1
A	accept()	0	3	1
A	setParent()	0	3	1
A	getLeft()	0	3	1
A	setLeft()	0	6	2
A	getRight()	0	3	1
A	getChildren()	0	4	1
A	__construct()	0	3	1
A	getParent()	0	3	1
A	setRight()	0	6	2
A	setItem()	0	3	1

<?php
declare(strict_types=1);
/*
 * Copyright (C) 2019 Sebastian Böttger <seboettg@gmail.com>
 * You may use, distribute and modify this code under the
 * terms of the MIT license.
 *
 * You should have received a copy of the MIT license with
 * this file. If not, please visit: https://opensource.org/licenses/mit-license.php
 */

namespace Seboettg\Forest\BinaryTree;

use Seboettg\Collection\ArrayList\ArrayListInterface;
use Seboettg\Forest\General\TreeNode;
use Seboettg\Forest\General\TreeNodeInterface;
use Seboettg\Forest\Item\ItemInterface;
use Seboettg\Forest\Visitor\VisitorInterface;

/**
 * Class BinaryNode
 * @package Seboettg\Forest\BinaryTree
 */
class BinaryNode extends TreeNode implements BinaryNodeInterface
{
    /**
     * @var BinaryNodeInterface
     */
    protected $left;

    /**
     * @var BinaryNodeInterface
     */
    protected $right;

    public function __construct(ItemInterface $item)
    {
        parent::__construct($item);
    }

    /**
     * @return BinaryNode
     */
    final public function getLeft(): ?BinaryNodeInterface
    {
        return $this->left;
    }

    /**
     * @param BinaryNodeInterface $left
     * @return void
     */
    final public function setLeft(?BinaryNodeInterface $left): void
    {
        if ($left !== null) {
            $left->setParent($this);
        }
        $this->left = $left;
    }

    /**
     * @return BinaryNode
     */
    final public function getRight(): ?BinaryNodeInterface
    {
        return $this->right;
    }

    /**
     * @param BinaryNodeInterface $right
     * @return void
     */
    final public function setRight(?BinaryNodeInterface $right): void
    {
        if ($right !== null) {
            $right->setParent($this);
        }
        $this->right = $right;
    }

    /**
     * @return mixed
     */
    final public function getItem(): ?ItemInterface
    {
        return $this->item;
    }

    /**
     * @codeCoverageIgnore
     * @param mixed $item
     * @return void
     */
    final public function setItem(ItemInterface $item): void
    {
        $this->item = $item;
    }

    /**
     * @return TreeNodeInterface[]
     */
    public function getChildren(): array
    {
        return array_filter([$this->left, $this->right], function(?BinaryNodeInterface $item) {
            return !empty($item);
        });
    }

    /**
     * @return TreeNodeInterface
     */
    public function getParent(): ?TreeNodeInterface
    {
        return $this->parent;
    }

    /**
     * @param TreeNodeInterface $parent
     */
    public function setParent(?TreeNodeInterface $parent): void
    {
        $this->parent = $parent;
    }

    /**
     * For visitors
     * @param VisitorInterface $visitor
     * @return ArrayListInterface
     */
    public function accept(VisitorInterface $visitor): ArrayListInterface
    {
        return $visitor->visit($this);
    }
}