**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 : image 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;
else
{
int l=height(root->left);
int r=height(root->right);
if(l>r)
return l+1;
else
return r+1;
}
}
In Java :
/*
class Node
int data;
Node left;
Node right;
*/
int height(Node root){
if (root == null){
return 0;
}
else{
return 1+Math.max(height(root.left), height(root.right));
}
}
In C :
int getHeight(Node* root){
int h;
Node *r=root;
h=Height(r);
// 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);
else
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
else:
return rightHeight
```

## View More Similar Problems

## Tree: Huffman Decoding

Huffman coding assigns variable length codewords to fixed length input characters based on their frequencies. More frequent characters are assigned shorter codewords and less frequent characters are assigned longer codewords. All edges along the path to a character contain a code digit. If they are on the left side of the tree, they will be a 0 (zero). If on the right, they'll be a 1 (one). Only t

View Solution →## Binary Search Tree : Lowest Common Ancestor

You are given pointer to the root of the binary search tree and two values v1 and v2. You need to return the lowest common ancestor (LCA) of v1 and v2 in the binary search tree. In the diagram above, the lowest common ancestor of the nodes 4 and 6 is the node 3. Node 3 is the lowest node which has nodes and as descendants. Function Description Complete the function lca in the editor b

View Solution →## Swap Nodes [Algo]

A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from

View Solution →## Kitty's Calculations on a Tree

Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a

View Solution →## Is This a Binary Search Tree?

For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a

View Solution →## Square-Ten Tree

The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the

View Solution →