Adding tests for "Binary search tree

traversal".

Author: cyrilverloop

CHANGELOG.md

@@ -32,6 +32,7 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 - Tests for "Game of life".
 - Tests for "Maximum sub-sequence".
 - Tests for "Snake encoding".
+- Tests for "Binary search tree traversal".
 
 ## [3.13.0] - 2022-09-30
 ### Added

src/Community/Training/Medium/BinarySearchTreeTraversal/BinarySearchTreeTraversal.dist

@@ -0,0 +1,31 @@
+<?php
+
+declare(strict_types=1);
+
+namespace CyrilVerloop\Codingame\Community\Training\Medium\BinarySearchTreeTraversal;
+
+use CyrilVerloop\Codingame\Puzzle;
+
+/**
+ * The "Binary search tree traversal" puzzle.
+ * @link https://www.codingame.com/ide/puzzle/binary-search-tree-traversal
+ */
+class BinarySearchTreeTraversal implements Puzzle
+{
+    public function execute($stdin): void
+    {
+        fscanf($stdin, "%d", $n);
+        $inputs = explode(" ", fgets($stdin));
+        for ($i = 0; $i < $n; $i++)
+        {
+            $vi = intval($inputs[$i]);
+        }
+        for ($i = 0; $i < 4; $i++)
+        {
+
+            // Write an answer using echo(). DON'T FORGET THE TRAILING \n
+
+            echo("answer\n");
+        }
+    }
+}

tests/Community/Training/Medium/BinarySearchTreeTraversal/CGTest.php

@@ -0,0 +1,101 @@
+<?php
+
+declare(strict_types=1);
+
+namespace CyrilVerloop\Codingame\Tests\Community\Training\Medium\BinarySearchTreeTraversal;
+
+use CyrilVerloop\Codingame\Tests\PuzzleTest;
+use CyrilVerloop\Codingame\Community\Training\Medium\BinarySearchTreeTraversal\BinarySearchTreeTraversal;
+
+/**
+ * Tests for the "Binary search tree traversal" puzzle.
+ *
+ * @covers \CyrilVerloop\Codingame\Community\Training\Medium\BinarySearchTreeTraversal\BinarySearchTreeTraversal
+ * @group binarySearchTreeTraversal
+ * @medium
+ */
+final class CGTest extends PuzzleTest
+{
+    public function setUp(): void
+    {
+        $this->puzzle = new BinarySearchTreeTraversal();
+    }
+
+    /**
+     * Test that the code can be executed for "Example".
+     *
+     * @group binarySearchTreeTraversal_example
+     */
+    public function testCanExecuteExample(): void
+    {
+        $this->expectExecuteOutputAnswer(
+            __DIR__ . '/input/01 - example.txt',
+            file_get_contents(__DIR__ . '/output/01 - example.txt')
+        );
+    }
+
+    /**
+     * Test that the code can be executed for "Positive values only".
+     *
+     * @group binarySearchTreeTraversal_positiveValuesOnly
+     */
+    public function testCanExecutePositiveValuesOnly(): void
+    {
+        $this->expectExecuteOutputAnswer(
+            __DIR__ . '/input/02 - positive values only.txt',
+            file_get_contents(__DIR__ . '/output/02 - positive values only.txt')
+        );
+    }
+
+    /**
+     * Test that the code can be executed for "Small random values".
+     *
+     * @group binarySearchTreeTraversal_smallRandomValues
+     */
+    public function testCanExecuteSmallRandomValues(): void
+    {
+        $this->expectExecuteOutputAnswer(
+            __DIR__ . '/input/03 - small random values.txt',
+            file_get_contents(__DIR__ . '/output/03 - small random values.txt')
+        );
+    }
+
+    /**
+     * Test that the code can be executed for "Large random values".
+     *
+     * @group binarySearchTreeTraversal_largeRandomValues
+     */
+    public function testCanExecuteLargeRandomValues(): void
+    {
+        $this->expectExecuteOutputAnswer(
+            __DIR__ . '/input/04 - large random values.txt',
+            file_get_contents(__DIR__ . '/output/04 - large random values.txt')
+        );
+    }
+
+    /**
+     * Test that the code can be executed for "More random values".
+     *
+     * @group binarySearchTreeTraversal_moreRandomValues
+     */
+    public function testCanExecuteMoreRandomValues(): void
+    {
+        $this->expectExecuteOutputAnswer(
+            __DIR__ . '/input/05 - more random values.txt',
+            file_get_contents(__DIR__ . '/output/05 - more random values.txt')
+        );
+    }
+
+    /**
+     * Test that the code can be executed for "Ordered values".
+     *
+     * @group binarySearchTreeTraversal_orderedValues
+     */
+    public function testCanExecuteOrderedValues(): void
+    {
+        $this->expectExecuteOutputAnswer(
+            __DIR__ . '/input/06 - ordered values.txt',
+            file_get_contents(__DIR__ . '/output/06 - ordered values.txt')
+        );
+    }
+}

tests/Community/Training/Medium/BinarySearchTreeTraversal/input/01 - example.txt

@@ -0,0 +1,2 @@
+5
+8 6 13 10 5

tests/Community/Training/Medium/BinarySearchTreeTraversal/input/02 - positive values only.txt

@@ -0,0 +1,2 @@
+8
+135 151 128 13 201 260 158 195

tests/Community/Training/Medium/BinarySearchTreeTraversal/input/03 - small random values.txt

@@ -0,0 +1,2 @@
+10
+-4 2 17 -15 -17 15 -12 11 30 29

tests/Community/Training/Medium/BinarySearchTreeTraversal/input/04 - large random values.txt

@@ -0,0 +1,2 @@
+14
+80549 235191 118837 -498143 -185405 -475495 428331 -146618 -479044 -173808 417544 204945 -479692 -70525

tests/Community/Training/Medium/BinarySearchTreeTraversal/input/05 - more random values.txt

@@ -0,0 +1,2 @@
+30
+-364052 -781443 796022 298864 295887 -614308 -296991 -1129497 838567 22573 40801 273590 1033779 715337 -38508 356628 514888 386934 930494 -907064 -916571 762755 -657230 -293721 822425 -314334 -862634 -146274 228429 1042357

tests/Community/Training/Medium/BinarySearchTreeTraversal/input/06 - ordered values.txt

@@ -0,0 +1,2 @@
+50
+1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50

tests/Community/Training/Medium/BinarySearchTreeTraversal/output/01 - example.txt

@@ -0,0 +1,4 @@
+8 6 5 13 10
+5 6 8 10 13
+5 6 10 13 8
+8 6 13 5 10