chore: adding minimal search tree

Author: rupeshtiwari

README.md

@@ -74,7 +74,12 @@
 
 ## Working with this repo
 
-Download or clone in local machine. Then run individual file in node console to see the results.
+- Download or clone in local machine. 
+- Run `npm ci`
+- Then run individual file to see result on console.
+- You should use `node filename` in console to see results.
+
+
 
 ## What to practice?
 

package-lock.json

@@ -0,0 +1,24 @@
+{
+  "name": "coding-examples-cs-fundamentals",
+  "version": "1.0.0",
+  "description": "Coding Interview Theory and Excercises",
+  "main": "index.js",
+  "scripts": {
+    "test": "echo \"Error: no test specified\" && exit 1"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/rupeshtiwari/coding-examples-cs-fundamentals.git"
+  },
+  "keywords": [
+    "algorithm",
+    "datastructure"
+  ],
+  "author": "Rupesh Tiwari",
+  "license": "ISC",
+  "bugs": {
+    "url": "https://github.com/rupeshtiwari/coding-examples-cs-fundamentals/issues"
+  },
+  "homepage": "https://github.com/rupeshtiwari/coding-examples-cs-fundamentals#readme",
+  "dependencies": {}
+}

package.json

@@ -1,14 +1,32 @@
 class Node {
-  constructor(data) {
-    this.value = data;
+  constructor(value) {
+    this.value = value;
     this.left = null;
     this.right = null;
   }
+
   toString() {
-    return `${this.value}, left -> ${this.left?.value}, right -> ${this.right?.value}`;
+    function print(prefix, node, isLeft) {
+      if (!node) return;
+      if (prefix) {
+        console.log(prefix + (isLeft ? '↙️--' : '↘️--') + node.value);
+      } else {
+        console.log('▶️' + node.value);
+      }
+      print(prefix + (isLeft ? '🔽   ' : '   '), node.left, true);
+      print(prefix + (isLeft ? '🔽   ' : '   '), node.right, false);
+    }
+    print('', this, false);
   }
 }
 
+/**
+ * Time complexity O(nlogn)
+ * @param arr Array
+ * @param start start index
+ * @param end end index of array
+ * @returns root node
+ */
 export function createMinimalBSTree(arr, start, end) {
   if (end < start) {
     return;