DataStructures\Trees\BinaryTreeAbstract

Complexity

Total Complexity

36

Size/Duplication

Total Lines	104
Duplicated Lines	42.31 %

Coupling/Cohesion

Components	1
Dependencies	0

Importance

Changes

0

18 Methods

Rating	Name	Duplication	Size	Complexity
A	empty()	0	3	1
A	size()	0	3	1
A	put()	0	1	1
A	putOrUpdate()	0	1	1
B	get()	22	22	6
A	getRoot()	0	3	1
B	exists()	0	22	6
A	floor()	0	1	1
A	ceil()	0	1	1
A	min()	0	1	1
A	max()	0	1	1
A	deleteMin()	0	1	1
A	deleteMax()	0	1	1
A	delete()	0	1	1
A	count()	0	1	1
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 empty() {
        return $this->root === null;
    }

    public function size() {
        return $this->size;
    }

    public function put($key, $data){}
    public function putOrUpdate($key, $data){}

    public function get($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 getRoot(){
        return $this->root;
    }

    public function exists($key){
        if($this->root === null) {
            return false;
        }

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

        return false;
    }

    public function floor($key){}
    public function ceil($key){}
    public function min(){}
    public function max(){}
    public function deleteMin(){}
    public function deleteMax(){}
    public function delete($key){}
    public function count() {}

    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($node) { // BinaryTreeNode
        return ($node !== null && $node->left === null && $node->right === null);
    }

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