BinaryTree::traverse() - Code Metrics - Inspection of "Started Work on Fib Heap and Binary Tree" - HOWZ1T/Ptypes - Measure and Improve Code Quality continuously with Scrutinizer

Completed

Push — development ( 2d042e...b2c933 )

by Dylan David

created 2018-03-31 09:19 UTC

BinaryTree::traverse() A

↳ Parent: BinaryTree

Complexity

Conditions	4
Paths	4

Size

Total Lines	18
Code Lines	9

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
dl	0
loc	18
rs	9.2
c	0
b	0
f	0
cc	4
eloc	9
nc	4
nop	1

<?php

namespace Ptypes;

use Ptypes\TreeNode;
use Ptypes\Exceptions\UnexpectedType;
use Ptypes\Exceptions\InvalidArgument;

class BinaryTree
{
	public const IN_ORDER = 0;
	public const PRE_ORDER = 1;
	public const POST_ORDER = 2;
	
	public $root;
	
	public function __construct()
	{
		$this->root = null;
	}
	
	public function insert($node) //$node is a treenode
	{
		$this->validate_parameter($node);
		
		if($this->root == null)
		{
			$this->root = $node;
			return $this;
		}
		
		$n = $this->root;
		while(1)
		{	
			if($node->value < $n->value)
			{
				if($n->left == null)
				{
					$n->left = $node;
					return $this;
				}
				
				$n = $n->left;
			}
			else if($node->value > $n->value)
			{
				if($n->right == null)
				{
					$n->right = $node;
					return $this;
				}
				
				$n = $n->right;
			}
			else if($node->value == $n->value) //node is already in the tree, we do not create duplicates!
			{
				return $this;
			}
		}
	}
	
	public function search($value)
	public function search(/** @scrutinizer ignore-unused */ $value)
	{
		
	}
	
	public function traverse($order)
	{
		switch($order)
		{
			case self::IN_ORDER:
				//TODO
				break;
				
			case self::PRE_ORDER:
				//TODO
				break;
				
			case self::POST_ORDER:
				//TODO
				break;
				
			default:
				throw new InvalidArgument("Invalid order: " . $order . "! Valid orders: IN_ORDER (BinaryTree::IN_ORDER), PRE_ORDER (BinaryTree::PRE_ORDER), and POST_ORDER (BinaryTree::POST_ORDER).\n");
		}
	}
	
	private function in_order_traversal($node, $results)
	private function in_order_traversal($node, /** @scrutinizer ignore-unused */ $results)
	{
		
	}
	
	private function validate_parameter($node)
	{
		if(gettype($node) != "object")
		{
			throw new UnexpectedType("Expected a Ptypes\TreeNode, got: " . gettype($node));
		}
		
		if(get_class($node) != "Ptypes\TreeNode")
		{
			throw new UnexpectedType("Expected a Ptypes\TreeNode, got: " . get_class($node));
		}
	}
}

HOWZ1T / Ptypes

Push — development ( 2d042e...b2c933 )

BinaryTree::traverse() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like