Skip to main content

Posts

Showing posts with the label Height Of Binary Search Tree

Day 22: Binary Search Trees Hackerrank Solution Java

 Day 22: Binary Search Trees Hackerrank Solution Java For Explanation Check Video: Sample Input 7 3 5 2 1 4 6 7 Sample Output 3 Code: import  java.util.*; import  java.io.*; class  Node{     Node left,right;      int  data;     Node( int  data){          this .data=data;         left=right=null;     } } class  Solution{      public   static   int  getHeight(Node root){        if (root==null){            return  - 1 ;       }        int  leftHeight = getHeight(root.left);        int  rightHeight = getHeight(root.right);      ...