fix(guide) add stubs, update spellings and prepare for move (#36531)

* fix(guide) add stubs and correct file path misspellings and pr… (#36528)

* fix: corrected file path to match curriculum

* fix: renamed to newer challenge name

* fix: added solutions to articles from challenge files

* fix: added missing .english to file name

* fix: added missing title to guide article

* fix: correct solution for guide article

* fix: replaced stub with hint

* fix: added space in Hint headers

* fix: added solution to guide article

* fix: added solution to guide article

* test: replaced stub with hint and solution

* fix: add Problem number: to title

* fix: changed generatorexponential to correct name

* fix: renamed knight's tour to knights-tour

* fix: updated guide article

guide/english/certifications/coding-interview-prep/data-structures/check-if-binary-search-tree/index.md

@@ -0,0 +1,50 @@
+---
+title: Check if Tree is Binary Search Tree
+---
+# Check if Tree is Binary Search Tree
+
+---
+## Solutions
+
+<details><summary>Solution 1 (Click to Show/Hide)</summary>
+
+```javascript
+var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2));
+function Node(value) {
+  this.value = value;
+  this.left = null;
+  this.right = null;
+}
+function BinarySearchTree() {
+  this.root = null;
+}
+function isBinarySearchTree(tree) {
+  if (tree.root == null) {
+    return null;
+  } else {
+    let isBST = true;
+    function checkTree(node) {
+      if (node.left != null) {
+        const left = node.left;
+        if (left.value > node.value) {
+          isBST = false;
+        } else {
+          checkTree(left);
+        }
+      }
+      if (node.right != null) {
+        const right = node.right;
+        if (right.value < node.value) {
+          isBST = false;
+        } else {
+          checkTree(right);
+        }
+      }
+    }
+    checkTree(tree.root);
+    return isBST;
+  }
+};
+```
+
+</details>