DataStructures\Trees\AVLTree

Complexity

Total Complexity

21

Size/Duplication

Total Lines	85
Duplicated Lines	0 %

Coupling/Cohesion

Components	0
Dependencies	0

Importance

Changes

0

21 Methods

Rating	Name	Duplication	Size	Complexity
A	empty()	0	3	1
A	size()	0	3	1
A	leftRotation()	0	3	1
A	rightRotation()	0	3	1
A	doubleRightRotation()	0	3	1
A	doubleLeftRotation()	0	3	1
A	put()	0	3	1
A	putOrUpdate()	0	3	1
A	get()	0	3	1
A	getRoot()	0	3	1
A	exists()	0	3	1
A	floor()	0	3	1
A	ceil()	0	3	1
A	min()	0	3	1
A	max()	0	3	1
A	deleteMin()	0	3	1
A	deleteMax()	0	3	1
A	delete()	0	3	1
A	search()	0	3	1
A	isLeaf()	0	3	1
A	isRoot()	0	3	1

<?php

namespace DataStructures\Trees;

use DataStructures\Trees\Interfaces\TreeInterface;
use DataStructures\Trees\Nodes\AVLNode as Node;

class AVLTree implements TreeInterface {

There is one abstract method count in this class; you could implement it, or declare this class as abstract.

    public function empty() {

    }

    public function size() {

    }

    private function leftRotation() {

This method is not used, and could be removed.

    }

    private function rightRotation() {

This method is not used, and could be removed.

    }

    private function doubleRightRotation() {

This method is not used, and could be removed.

    }

    private function doubleLeftRotation() {

This method is not used, and could be removed.

    }

    public function put($key, $data) {

    }

    public function putOrUpdate($key, $data) {

    }

    public function get($key) {

    }

    public function getRoot() {

    }

    public function exists($key) {

    }

    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 search($key) {

    }

    public function isLeaf($node) {

    }

    public function isRoot($node) {

    }
}