search of k in BST

Author: manju07

Data-Structure/Tree/Binary Search Tree/Checking and Searching/searchK.js

@@ -0,0 +1,48 @@
+'use strict';
+class Node {
+    constructor(data) {
+        this.data = data;
+        this.leftNode = this.rightNode = null;
+    }
+}
+
+function insertionOfk(root, k) {
+    if (root == null) return new Node(k);
+    if (root.data > k)
+        root.leftNode = insertionOfk(root.leftNode, k);
+    else if (root.data < k)
+        root.rightNode = insertionOfk(root.rightNode, k);
+    return root;
+}
+
+function searchK(root, k) {
+    if (root == null) return false;
+    else if (root.data == k) return true;
+    else if (root.data > k) return searchK(root.leftNode, k);
+    else return searchK(root.rightNode, k);
+}
+
+function inorderDisplay(root, inOrderArr) {
+    if (root == null) return;
+    inorderDisplay(root.leftNode, inOrderArr);
+    inOrderArr.push(root.data);
+    inorderDisplay(root.rightNode, inOrderArr);
+}
+
+let tree = null;
+tree = insertionOfk(tree, 4);
+tree = insertionOfk(tree, 2);
+tree = insertionOfk(tree, 3);
+tree = insertionOfk(tree, 1);
+tree = insertionOfk(tree, 6);
+tree = insertionOfk(tree, 5);
+tree = insertionOfk(tree, 7);
+
+//  Inorder display
+let inOrderArr = [];
+inorderDisplay(tree, inOrderArr);
+console.log('Inorder - ', inOrderArr.join(', '));
+
+//  Search K
+let k = 7;
+console.log(k + ' is found ? - ', searchK(tree, k));