Height of the tree

Height of a binary tree

int height(Node* root)
{
    // Base case: empty tree has height 0
    if (root == nullptr)
        return 0;
 
    // recur for left and right subtree and consider maximum depth
    return 1 + max(height(root->left), height(root->right));
}

Source: techiedelight.com

Find height of a tree

// finding height of a binary tree in c++.
int maxDepth(node* node)  
{  
    if (node == NULL)  
        return 0;  
    else
    {  
        /* compute the depth of each subtree */
        int lDepth = maxDepth(node->left);  
        int rDepth = maxDepth(node->right);  
      
        /* use the larger one */
        if (lDepth > rDepth)  
            return(lDepth + 1);  
        else return(rDepth + 1);  
    }  
}

Height of Binary tree

public static int height(Node root) 
{
  if(root==null)
  	return -1;
  if(root.left==null && root.right ==null)
  	return 0;
  return  1 + Math.max(height(root.left),height(root.right));
}


// node Structure for reference
    public class Node
    {
        public int data;
        public Node left;
        public Node right;
        public Node(int data)
        {
            this.data = data;
        }
    }

Height of the tree

int height(Node* root) {
        // Base Condition : if root is already null. then height must be -1 to make balance with recursion call...
        if(!root) return 0;
        
        // Actual Return statement.. for recursion call..
        return 1 + max(height(root->left), height(root->right));
    }

Similar codes

-1 vote135 views1 answer
Find substring in string c++
C++
2 votes139 views3 answers
C++ lambda
C++
2 votes142 views3 answers
Print space in array cpp
C++
0 vote142 views1 answer
Sfml get position
C++
0 vote138 views1 answer
. The cout with the insertion operator (<<) is used to print a statement
C++
0 vote134 views1 answer
Check whether K-th bit is set or not c++
C++
-1 vote136 views1 answer
Sinonimo de tratar
C++
0 vote146 views1 answer
Finding no of unique characters in a string c++
C++
0 vote137 views1 answer
Give an algorithm for finding the ith-to-last node in a singly linked list in which the last node is indicated by a null next reference.
C++
0 vote142 views1 answer
How to define global array in c++ in a scope
C++