Coding Challenge Day 7: Problem 1: Calculate height of a Binary Tree

Hello! So I’m doing a 30 day coding challenge where I solve around 3-5 questions per day and thought of posting them here on my blog so that you guys can join the challenge too!

Welcome to Coding challenge Day 7: Problem 1! Be sure to post your answers, queries etc in the comments!

Problem:Write a Program to Find the Maximum Depth or Height of a Binary Tree


Output: Height of binary tree: 3


  • Algorithm:
  • if node is null then return zero
  • Else
    • recurcively find the max height of left subtree
    • recursively find the max height of right subtree
    • during each recursion compare heights of left and right subtree and return the greater out of the two +1
package tree.binarytree;

public class Program010height_of_binary_tree {
	static class Node{
		int data;
		Node left_child, right_child;
		public Node(int d){
			data= d;
			left_child= right_child= null;
	static class Binary_tree{
		Node root;
		public Binary_tree(){
			root= null;
		public void add_left_child (Node parent_node, Node left_node){
			parent_node.left_child= left_node;
		public void add_right_child (Node parent_node, Node right_node){
			parent_node.right_child= right_node;
	public static int find_height(Node node){
			return 0;
		int left_height= find_height(node.left_child);
		int right_height= find_height(node.right_child);
			return (left_height +1);
			return (right_height +1);
	public static void main (String [] args){
		Binary_tree tree= new Binary_tree();
		tree.root= new Node(1);
		Node node2= new Node(2);
		tree.add_left_child(tree.root, node2);
		Node node3= new Node(3);
		tree.add_right_child(tree.root, node3);
		Node node4= new Node(4);
		tree.add_left_child(node2, node4);
		Node node5= new Node(5);
		tree.add_right_child(node2, node5);
		Node node6= new Node(6);
		tree.add_left_child(node3, node6);
		Node node7= new Node(7);
		tree.add_right_child(node3, node7);
		System.out.println("Height of binary tree: "+ find_height(tree.root));

Download Code

Happy Learning!!

Leave a Reply


Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.

search previous next tag category expand menu location phone mail time cart zoom edit close