Breaking News: Grepper is joining You.com. Read the official announcement!

Height Of Binary Tree

Add Answer

Mysterious Meerkat answered on June 5, 2020 Popularity 10/10 Helpfulness 1/10

answer Height Of Binary Tree

related height of a binary tree

related height of binary tree java

related find height of a tree

related height of the tree

related Height Of Binary Tree

related Height of Binary tree Java

related height of binary tree

Height Of Binary Tree

Comment


height(10) = max(height(5), height(30)) + 1

height(30) = max(height(28), height(42)) + 1
height(42) = 0 (no children)
height(28) = 0 (no children)

height(5) =  max(height(4), height(8)) + 1
height(4) = 0 (no children)
height(8) = 0 (no children)

Popularity 10/10 Helpfulness 1/10 Language javascript

Source: nullorempty.org

Tags: binary-tree height javascript

Link to this answer
Share Copy Link

Contributed on Feb 17 2022

Mysterious Meerkat

0 Answers Avg Quality 2/10

Closely Related Answers

height of a binary tree

Comment

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));
}

Popularity 10/10 Helpfulness 4/10 Language whatever

Source: www.techiedelight.com

Tags: binary-tree bina

Link to this answer
Share Copy Link

Contributed on Jul 23 2020

Elegant Elk

0 Answers Avg Quality 2/10

height of binary tree java

Comment

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;
        }
    }

Popularity 10/10 Helpfulness 4/10 Language java

Source: Grepper

Tags: binary-tree bina

Link to this answer
Share Copy Link

Contributed on Jan 18 2022

PrashantUnity

0 Answers Avg Quality 2/10

find height of a tree

Comment

// 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);  
    }  
}

Popularity 10/10 Helpfulness 3/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Jun 05 2020

Enthusiastic Elephant

0 Answers Avg Quality 2/10

height of the tree

Comment

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));
    }

Popularity 10/10 Helpfulness 3/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Dec 02 2021

0 Answers Avg Quality 2/10

Height Of Binary Tree

Comment

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 leftChild;
        public Node rightChild;
        public Node(int data)
        {
            this.data = data;
        }
    }

Popularity 10/10 Helpfulness 2/10 Language csharp

Source: Grepper

Tags: binary-tree bina

Link to this answer
Share Copy Link

Contributed on Jan 18 2022

PrashantUnity

0 Answers Avg Quality 2/10

Height of Binary tree Java

Comment

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 leftChild;
        public Node rightChild;
        public Node(int data)
        {
            this.data = data;
        }
    }

Popularity 9/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: binary-tree bina

Link to this answer
Share Copy Link

Contributed on Jan 18 2022

PrashantUnity

0 Answers Avg Quality 2/10

height of binary tree

Comment

-2

//claculate the minimum height of binary tree 
const minHeightTree =(root)=>{
  if (!root) return 0;
  let left = minHeightTree(root.left);
  console.log(left)
  let right = minHeightTree(root.right);
  console.log(right)
 
  if(left< right){
 
   return left +1 ;
 
  }else { 
   return right+1 ; 
  }
 };

Popularity 10/10 Helpfulness 1/10 Language javascript

Source: Grepper

Tags: binary-tree bina

Link to this answer
Share Copy Link

Contributed on Sep 17 2022

Mohammad alshraideh

0 Answers Avg Quality 2/10

Height Of Binary Tree

Contents

More Related Answers

Height Of Binary Tree

Closely Related Answers

height of a binary tree

height of binary tree java

find height of a tree

height of the tree

Height Of Binary Tree

Height of Binary tree Java

height of binary tree

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.