Tree: Height of a Binary Tree

                            Solution in C :

In C++ :




/*The tree node has data, left child and right child 
struct node
{
    int data;
    node* left;
    node* right;
};

*/
int height(node * root)
{
  if(root==NULL) return 0;
    else
        {
        int l=height(root->left);
        int r=height(root->right);
        if(l>r)
            return l+1;
        else
            return r+1;
    }
}
  




In Java :



   /*
    
    class Node 
       int data;
       Node left;
       Node right;
   */
   int height(Node root){
       if (root == null){
           return 0;
       }
       else{
           return 1+Math.max(height(root.left), height(root.right));
    }
   }



In C :


int getHeight(Node* root){
    int h;
    Node *r=root;
      h=Height(r);
    // Write your code here
   
  
    return h-1;
}
int  Height(Node* r){
    if (r == NULL) 
           return 0;

       // Compute height of each tree
       int heightLeft = Height(r->left);
       int heightRight = Height(r->right);

       /* use the larger one */
       if (heightLeft > heightRight) 
           return(heightLeft + 1);
       else 
           return(heightRight + 1);
    }


In python3 :



    def getHeight(self,root):
        #Write your code here
        leftHeight = 0
        rightHeight = 0
        if( root.left):            
            leftHeight = self.getHeight(root.left) + 1
            
        if( root.right):
            rightHeight = self.getHeight(root.right) + 1        
       
        if( leftHeight > rightHeight ):
            return leftHeight
        else:
            return rightHeight