Adding tests for "Binary search tree

traversal".

Author: cyrilverloop

CHANGELOG.md

@@ -33,6 +33,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".
 
 ## [1.13.0] - 2022-09-30
 ### Added

lib/community/training/medium/binarySearchTreeTraversal/binarySearchTreeTraversal.dist

@@ -0,0 +1,20 @@
+/**
+ * The "Binary search tree traversal" puzzle.
+ * @see {@link https://www.codingame.com/ide/puzzle/binary-search-tree-traversal}
+ */
+function execute(readline) {
+    const n = parseInt(readline());
+    var inputs = readline().split(' ');
+    for (let i = 0; i < n; i++) {
+        const vi = parseInt(inputs[i]);
+    }
+    for (let i = 0; i < 4; i++) {
+
+        // Write an answer using console.log()
+        // To debug: console.error('Debug messages...');
+
+        console.log('answer');
+    }
+}
+
+export { execute };

test/community/training/medium/binarySearchTreeTraversal/CGTest.js

@@ -0,0 +1,68 @@
+import { assert } from 'chai';
+import sinon from 'sinon';
+import File from '../../../../File.js';
+import { assertOutputAnswer } from '../../../../assertOutputAnswer.js';
+import { execute } from '../../../../../lib/community/training/medium/binarySearchTreeTraversal/binarySearchTreeTraversal.js';
+
+const __dirname = new URL('.', import.meta.url).pathname;
+
+suite("Binary search tree traversal", function() {
+    const sandbox = sinon.createSandbox();
+
+    setup(function () {
+        sandbox.stub(console, "log");
+    });
+
+    teardown(function () {
+        sandbox.restore();
+    });
+
+
+    test("Example", function() {
+        let inputFile = new File(__dirname + 'input/01 - example.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assertOutputAnswer(__dirname + 'output/01 - example.txt');
+    });
+
+    test("Positive values only", function() {
+        let inputFile = new File(__dirname + 'input/02 - positive values only.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assertOutputAnswer(__dirname + 'output/02 - positive values only.txt');
+    });
+
+    test("Small random values", function() {
+        let inputFile = new File(__dirname + 'input/03 - small random values.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assertOutputAnswer(__dirname + 'output/03 - small random values.txt');
+    });
+
+    test("Large random values", function() {
+        let inputFile = new File(__dirname + 'input/04 - large random values.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assertOutputAnswer(__dirname + 'output/04 - large random values.txt');
+    });
+
+    test("More random values", function() {
+        let inputFile = new File(__dirname + 'input/05 - more random values.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assertOutputAnswer(__dirname + 'output/05 - more random values.txt');
+    });
+
+    test("Ordered values", function() {
+        let inputFile = new File(__dirname + 'input/06 - ordered values.txt');
+
+        execute(inputFile.readline.bind(inputFile));
+
+        assertOutputAnswer(__dirname + 'output/06 - ordered values.txt');
+    });
+});

test/community/training/medium/binarySearchTreeTraversal/input/01 - example.txt

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

test/community/training/medium/binarySearchTreeTraversal/input/02 - positive values only.txt

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

test/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

test/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

test/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

test/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

test/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