View GitHub Repository Ptypes

Schedule Inspection
Subscribe
Completed
Push — development ( 6c43d4...f4178d )
by Dylan David
01:42
created
Status
Category
Toggle Patches
Ptypes/Test/BinaryTreeTest.php 1 patch
Spacing   +7 added lines, -7 removed lines patch added patch discarded remove patch 
@@ -28,7 +28,7 @@  discard block
 
 block discarded – undo
28 28 
 	{
29 29 
 		$tree = new BinaryTree();
30 30 
 		$tree->insert(new TreeNode(8))->insert(new TreeNode(5))->insert(new TreeNode(9))->insert(new TreeNode(4))->insert(new TreeNode(14))->insert(new TreeNode(6))->insert(new TreeNode(12));
31 
-		$this->assertEquals($tree->traverse(BinaryTree::IN_ORDER), array(4,5,6,8,9,12,14));
31 
+		$this->assertEquals($tree->traverse(BinaryTree::IN_ORDER), array(4, 5, 6, 8, 9, 12, 14));
32 32 
 	}
33 33
34 34 
 	/** @test */
 
@@ -47,7 +47,7 @@  discard block
 
 block discarded – undo
47 47 
 		$root->right->right->left = new TreeNode(3);
48 48
49 49 
 		$tree = new BinaryTree($root);
50 
-		$this->assertEquals($tree->traverse(BinaryTree::IN_ORDER), array(9,5,1,7,2,12,8,4,3,11));
50 
+		$this->assertEquals($tree->traverse(BinaryTree::IN_ORDER), array(9, 5, 1, 7, 2, 12, 8, 4, 3, 11));
51 51 
 	}
52 52
53 53 
 	/** @test */
 
@@ -66,7 +66,7 @@  discard block
 
 block discarded – undo
66 66 
 		$root->right->right->left = new TreeNode(3);
67 67
68 68 
 		$tree = new BinaryTree($root);
69 
-		$this->assertEquals($tree->traverse(BinaryTree::PRE_ORDER), array(8,5,9,7,1,12,2,4,11,3));
69 
+		$this->assertEquals($tree->traverse(BinaryTree::PRE_ORDER), array(8, 5, 9, 7, 1, 12, 2, 4, 11, 3));
70 70 
 	}
71 71
72 72 
 	/** @test */
 
@@ -85,7 +85,7 @@  discard block
 
 block discarded – undo
85 85 
 		$root->right->right->left = new TreeNode(3);
86 86
87 87 
 		$tree = new BinaryTree($root);
88 
-		$this->assertEquals($tree->traverse(BinaryTree::POST_ORDER), array(9,1,2,12,7,5,3,11,4,8));
88 
+		$this->assertEquals($tree->traverse(BinaryTree::POST_ORDER), array(9, 1, 2, 12, 7, 5, 3, 11, 4, 8));
89 89 
 	}
90 90
91 91 
 	/** @test */
 
@@ -104,7 +104,7 @@  discard block
 
 block discarded – undo
104 104
105 105 
 		$tree = new BinaryTree($root);
106 106 
 		$tree->delete(9);
107 
-		$this->assertEquals($tree->traverse(BinaryTree::IN_ORDER), array(1,3,4,5,8,11,12));
107 
+		$this->assertEquals($tree->traverse(BinaryTree::IN_ORDER), array(1, 3, 4, 5, 8, 11, 12));
108 108 
 	}
109 109
110 110 
 	/** @test */
 
@@ -167,9 +167,9 @@  discard block
 
 block discarded – undo
167 167 
 		*/
168 168
169 169 
 		$nodes = $tree->traverse(BinaryTree::LEVEL_ORDER);
170 
-		foreach($nodes as $i => $level)
170 
+		foreach ($nodes as $i => $level)
171 171 
 		{
172 
-			foreach($level as $j => $node)
172 
+			foreach ($level as $j => $node)
173 173 
 			{
174 174 
 				echo $node->value . " ";
175 175 
 			}
Please login to merge, or discard this patch.