Find the Minimum and Maximum Height of a Binary Search Tree

Emmanuel Akin-Ademola answered on September 16, 2022 Popularity 9/10 Helpfulness 1/10

answer Find the Minimum and Maximum Height of a Binary Search Tree

Find the Minimum and Maximum Height of a Binary Search Tree

Comment

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.findMinHeight = function() {
    if (!this.root) return -1;

    function findNodeMinHeight(node) {
      if (!node) return 0;
      return 1 + Math.min(
          findNodeMinHeight(node.left),
          findNodeMinHeight(node.right)
        );
    }

    return findNodeMinHeight(this.root) - 1;
  }

  this.findMaxHeight = function() {
    if (!this.root) return -1;

    function findNodeMaxHeight(node) {
      if (!node) return 0;
      return 1 + Math.max(
          findNodeMaxHeight(node.left),
          findNodeMaxHeight(node.right)
        );
    }

    return findNodeMaxHeight(this.root) - 1;
  }

  this.isBalanced = function() {
    return this.findMinHeight() == this.findMaxHeight();
  }
  // Only change code above this line
}

Popularity 9/10 Helpfulness 1/10 Language whatever

Source: forum.freecodecamp.org

Tags: binary-search-tree find height minimum whatever

Link to this answer
Share Copy Link