Write a recursive function to calculate the height of a binary tree in

1.	Write a recursive function to calculate the height of a binary tree in Java.
Answer» Consider that every node of a tree represents a class called Node as given below: public class Node{ int data; Node left; Node right; } Then the height of the binary tree can be found as follows: int heightOfBinaryTree(Node node) { if (node == null) return 0; // If node is null then height is 0 for that node. else { // compute the height of each subtree int leftHeight = heightOfBinaryTree(node.left); int rightHeight = heightOfBinaryTree(node.right); //use the larger among the left and right height and plus 1 (for the root) return Math.max(leftHeight, rightHeight) + 1; } }

Write a recursive function to calculate the height of a binary tree in Java.

Answer»

Consider that every node of a tree represents a class called Node as given below:

public class Node{
int data;
Node left;
Node right;
}

Then the height of the binary tree can be found as follows:

int heightOfBinaryTree(Node node)
{
if (node == null)
return 0; // If node is null then height is 0 for that node.
else
{
// compute the height of each subtree
int leftHeight = heightOfBinaryTree(node.left);
int rightHeight = heightOfBinaryTree(node.right);
//use the larger among the left and right height and plus 1 (for the root)
return Math.max(leftHeight, rightHeight) + 1;
}
}

Discussion

No Comment Found

Related InterviewSolutions

What is topological sorting in a graph?
Given an m x n 2D grid map of '1’s which represents land and '0’s that represents water return the number of islands (surrounded by water and formed by connecting adjacent lands in 2 directions - vertically or horizontally).
Print Left view of any binary trees.
Write Java code to count number of nodes in a binary tree
Write a recursive function to calculate the height of a binary tree in Java.
Write a function to determine whether duplicate elements in a given array are within a given distance of each other.
Implement LRU(Least Recently Used) Cache
Write a function to find number of structurally unique binary trees are possible
Write a function to connect nodes at the same level of a binary tree
Write a function to implement Quicksort on Doubly Linked List

Write a recursive function to calculate the height of a binary tree in Java.

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment