We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Tutorials
  3. 30 Days of Code
  4. Day 22: Binary Search Trees
  5. Discussions

Day 22: Binary Search Trees

  • devsagarkumarjha
     + 0 comments

    Java solution 

    public static int getHeight(Node root){
  //Write your code here
  int height = -1;

  if(root != null){


  int leftHeight = getHeight(root.left);
  int rightHeight = getHeight(root.right);

  height = Math.max(leftHeight, rightHeight) + 1;
  }

  return height;
}