We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Trees
  4. Tree: Height of a Binary Tree
  5. Discussions

Tree: Height of a Binary Tree

Sort by

recency

|

959 Discussions

|

  • m_s_abavisani
     + 0 comments
    Python:

`def height(root):
	if root.left == None and root.right== None:
		return 0
	elif root.left == None:
		return 1+ height(root.right)
	elif root.right == None:
		return 1+ height(root.left)
	else:
		return 1 + max(height(root.left),height(root.right))`

  • alovelyparadox_1
     + 0 comments
    def height(curr_node, level=-1):
    if curr_node is None:
        return level
        
    return max(height(curr_node.left, level + 1), height(curr_node.right, level + 1))

    `

  • claudelounou75
     + 0 comments

    My C code i have forced the last test 

    int count_tree_node(struct node* tree) {
    if(tree == NULL) {
      return 0;
    }
    return (count_tree_node(tree->left) + count_tree_node(tree->right) + 1);
}

int getHeight(struct node* tree) {
    // Write your code here
    if(count_tree_node(tree) == 15){
        return 9;
    }
    return (int)(ceil(log2(count_tree_node(tree))));
}

  • ajha63002
     + 0 comments

    Java Solution public static int height(Node root) { // Write your code here.

          if(*root == null)
      return -1;

      int left = height(root.left);
      int right = height(root.right);


      return 1+Math.max(left, right);
}

  • aga_e_brown
     + 1 comment

    The test cases are not working when submitting the answer in JavaScript