min and max in binary search tree

Author: Manjunath

Data-Structure/Tree/Binary Search Tree/minAndMaxInBST.js

@@ -0,0 +1,44 @@
+'use strict';
+class Node {
+    constructor(data) {
+        this.data = data;
+        this.leftNode = this.rightNode = null;
+    }
+}
+
+function insertInBST(root, data) {
+    if (root == null) return new Node(data);
+    else if (root.data > data) root.leftNode = insertInBST(root.leftNode, data);
+    else root.rightNode = insertInBST(root.rightNode, data);
+    return root;
+}
+
+function inorderDisplay(root) {
+    if (root == null) return;
+    inorderDisplay(root.leftNode);
+    console.log(root.data);
+    inorderDisplay(root.rightNode);
+}
+
+function minInBST(root) {
+    if (root == null) return null;
+    if (root.leftNode == null) return root;
+    return minInBST(root.leftNode);
+}
+
+function maxInBST(root) {
+    if (root == null) return null;
+    if (root.rightNode == null) return root;
+    return maxInBST(root.rightNode);
+}
+
+let tree = null;
+tree = insertInBST(tree, 4);
+tree = insertInBST(tree, 2);
+tree = insertInBST(tree, 3);
+tree = insertInBST(tree, 1);
+tree = insertInBST(tree, 6);
+tree = insertInBST(tree, 5);
+tree = insertInBST(tree, 7);
+console.log('Min In BST', minInBST(tree).data);
+console.log('Max In BST', maxInBST(tree).data);