@@ -23,18 +23,18 @@ discard block |
||
| 23 | 23 | { |
| 24 | 24 | $this->validate_parameter($node); |
| 25 | 25 | |
| 26 | - if($this->root == null) |
|
| 26 | + if ($this->root == null) |
|
| 27 | 27 | { |
| 28 | 28 | $this->root = $node; |
| 29 | 29 | return $this; |
| 30 | 30 | } |
| 31 | 31 | |
| 32 | 32 | $n = $this->root; |
| 33 | - while(1) |
|
| 33 | + while (1) |
|
| 34 | 34 | { |
| 35 | - if($node->value < $n->value) |
|
| 35 | + if ($node->value < $n->value) |
|
| 36 | 36 | { |
| 37 | - if($n->left == null) |
|
| 37 | + if ($n->left == null) |
|
| 38 | 38 | { |
| 39 | 39 | $n->left = $node; |
| 40 | 40 | return $this; |
@@ -42,9 +42,9 @@ discard block |
||
| 42 | 42 | |
| 43 | 43 | $n = $n->left; |
| 44 | 44 | } |
| 45 | - else if($node->value > $n->value) |
|
| 45 | + else if ($node->value > $n->value) |
|
| 46 | 46 | { |
| 47 | - if($n->right == null) |
|
| 47 | + if ($n->right == null) |
|
| 48 | 48 | { |
| 49 | 49 | $n->right = $node; |
| 50 | 50 | return $this; |
@@ -52,7 +52,7 @@ discard block |
||
| 52 | 52 | |
| 53 | 53 | $n = $n->right; |
| 54 | 54 | } |
| 55 | - else if($node->value == $n->value) //node is already in the tree, we do not create duplicates! |
|
| 55 | + else if ($node->value == $n->value) //node is already in the tree, we do not create duplicates! |
|
| 56 | 56 | { |
| 57 | 57 | return $this; |
| 58 | 58 | } |
@@ -61,7 +61,7 @@ discard block |
||
| 61 | 61 | |
| 62 | 62 | public function search($value) |
| 63 | 63 | { |
| 64 | - if(gettype($value) != "integer" && gettype($value) != "int" && gettype($value) != "double") |
|
| 64 | + if (gettype($value) != "integer" && gettype($value) != "int" && gettype($value) != "double") |
|
| 65 | 65 | { |
| 66 | 66 | throw new InvalidArgument("Expected a number, got: " . gettype($value) . " !\n"); |
| 67 | 67 | } |
@@ -71,22 +71,22 @@ discard block |
||
| 71 | 71 | |
| 72 | 72 | private function recursive_search($value, $node) |
| 73 | 73 | { |
| 74 | - if($node == null) |
|
| 74 | + if ($node == null) |
|
| 75 | 75 | { |
| 76 | 76 | return null; |
| 77 | 77 | } |
| 78 | 78 | |
| 79 | - $eval = $value - $node->value; |
|
| 80 | - if($eval == 0) |
|
| 79 | + $eval = $value-$node->value; |
|
| 80 | + if ($eval == 0) |
|
| 81 | 81 | { |
| 82 | 82 | return $node; |
| 83 | 83 | } |
| 84 | 84 | |
| 85 | - if($eval < 0) |
|
| 85 | + if ($eval < 0) |
|
| 86 | 86 | { |
| 87 | 87 | return $this->recursive_search($value, $node->left); |
| 88 | 88 | } |
| 89 | - else if($eval > 0) |
|
| 89 | + else if ($eval > 0) |
|
| 90 | 90 | { |
| 91 | 91 | return $this->recursive_search($value, $node->right); |
| 92 | 92 | } |
@@ -94,7 +94,7 @@ discard block |
||
| 94 | 94 | |
| 95 | 95 | public function traverse($order) |
| 96 | 96 | { |
| 97 | - switch($order) |
|
| 97 | + switch ($order) |
|
| 98 | 98 | { |
| 99 | 99 | case self::IN_ORDER: |
| 100 | 100 | $this->in_order_traversal($this->root); |
@@ -129,12 +129,12 @@ discard block |
||
| 129 | 129 | |
| 130 | 130 | private function validate_parameter($node) |
| 131 | 131 | { |
| 132 | - if(gettype($node) != "object") |
|
| 132 | + if (gettype($node) != "object") |
|
| 133 | 133 | { |
| 134 | 134 | throw new UnexpectedType("Expected a Ptypes\TreeNode, got: " . gettype($node)); |
| 135 | 135 | } |
| 136 | 136 | |
| 137 | - if(get_class($node) != "Ptypes\TreeNode") |
|
| 137 | + if (get_class($node) != "Ptypes\TreeNode") |
|
| 138 | 138 | { |
| 139 | 139 | throw new UnexpectedType("Expected a Ptypes\TreeNode, got: " . get_class($node)); |
| 140 | 140 | } |