Height Of Binary Tree Iteratively

Java Implementation of calculating height of binary tree iteratively.

import java.util.LinkedList;
import java.util.Queue;

class Solution
{
    static class TreeNode{
        int data;
        TreeNode left,right;
        TreeNode(int data)
        {
            this.data=data;
        }
    }
    static int heightOfBinaryTree(TreeNode root)
    {
        Queue<TreeNode> queue=new LinkedList<>();
        queue.add(root);
        int height=0;
        while(!queue.isEmpty())
        {
            int s=queue.size();
            height++;
            for(int i=0;i<s;i++)
            {
            TreeNode temp=queue.poll();
            if(temp.left!=null)
                queue.add(temp.left);
            if(temp.right!=null)
                queue.add(temp.right);
            }
            
        }
        return height;
    }
     public static void main(String[] args)
    {
        TreeNode root=new TreeNode(1);
        root.left=new TreeNode(2);
        root.right=new TreeNode(3);
        root.left.left=new TreeNode(4);
        root.left.right=new TreeNode(7);
        
        int height=heightOfBinaryTree(root);
        System.out.println(height);
         
    }
    }

Output: 3

Time Complexity- O(n)

Space Complexity-O(n)

Leave a comment

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

Pin It on Pinterest