Tree: Height of a Binary Tree

Problem Statement :

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height :

Function Description

Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer.

getHeight or height has the following parameter(s):

root: a reference to the root of a binary tree.
Note -The Height of binary tree with single node is taken as zero.

Input Format

The first line contains an integer , the number of nodes in the tree.
Next line contains  space separated integer where th integer denotes node[i].data.

Note: Node values are inserted into a binary search tree before a reference to the tree's root node is passed to your function. In a binary search tree, all nodes on the left branch of a node are less than the node value. All values on the right branch are greater than the node value.

Output Format

Your function should return a single integer denoting the height of the binary tree.

Solution :


                            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;
        int l=height(root->left);
        int r=height(root->right);
            return l+1;
            return r+1;

In Java :

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

In C :

int getHeight(Node* root){
    int h;
    Node *r=root;
    // 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);
           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
            return rightHeight

View More Similar Problems

Subsequence Weighting

A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =

View Solution →

Kindergarten Adventures

Meera teaches a class of n students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from 1 to n in the clockwise direction. This means that the students are numbered 1, 2, 3, . . . , n-1, n, and students 1 and n are sitting next to each other. After letting the students draw for a certain period of ti

View Solution →

Mr. X and His Shots

A cricket match is going to be held. The field is represented by a 1D plane. A cricketer, Mr. X has N favorite shots. Each shot has a particular range. The range of the ith shot is from Ai to Bi. That means his favorite shot can be anywhere in this range. Each player on the opposite team can field only in a particular range. Player i can field from Ci to Di. You are given the N favorite shots of M

View Solution →

Jim and the Skyscrapers

Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently. Let us describe the problem in one dimensional space

View Solution →

Palindromic Subsets

Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t

View Solution →

Counting On a Tree

Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n

View Solution →