freeCodeCamp Challenge Guide: Find the Minimum and Maximum Value in a Binary Search Tree

Guide
1

Find the Minimum and Maximum Value in a Binary Search Tree

Solutions

Solution 1 (Click to Show/Hide) 
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;
  // Only change code below this line
  this.findMin = function() {
    if (!this.root) return null;

    let curr = this.root;
    while (curr.left) { curr = curr.left; }
    return curr.value;
  }

  this.findMax = function() {
    if (!this.root) return null;

    let curr = this.root;
    while (curr.right) { curr = curr.right; }
    return curr.value;
  }
  // Only change code above this line
}
3 Likes