DataStructures\Trees\BinaryTreeAbstract

Complexity

Total Complexity

11

Size/Duplication

Total Lines	35
Duplicated Lines	62.86 %

Coupling/Cohesion

Components	1
Dependencies	0

Importance

Changes

0

3 Methods

Rating	Name	Duplication	Size	Complexity
B	search()	22	22	6
A	isLeaf()	0	3	3
A	isRoot()	0	3	2

<?php

namespace DataStructures\Trees;

use DataStructures\Trees\Interfaces\TreeInterface;

abstract class BinaryTreeAbstract implements TreeInterface {
    protected $root;
    protected $size;

    public function search($key) {

This method seems to be duplicated in your project.

        if($this->root === null) {
            return null;
        }

        if($this->root->key === $key) {
            return $this->root->data;
        } else {
            $node = $this->root;
            while($node !== null) {
                if($key < $node->left) {
                    $node = $node->left;
                } else if($key > $node->right) {
                    $node = $node->right;
                } else {
                    return $node->data;
                }
            }
        }

        return null;
    }
    
    public function isLeaf(BinaryTreeNode $node) {
        return ($node !== null && $node->left === null && $node->right === null);
    }

    public function isRoot($node) {
        return $node !== null && $node->parent === null;
    }
}