HackerRank - Tree - height of tree

heightOfTree.cpp

/*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;
   if(root!=NULL && root->left==NULL && root->right==NULL)
       return 0; 
    
   int hl = height(root->left); 
   int hr = height(root->right); 
   return hl>=hr?(1+hl):(1+hr); 
}