Height of Binary Tree Java

PROGRAM TO FIND THE MAXIMUM DEPTH OR HEIGHT OF A TREE

class Node

{

    int data;

    Node left, right;

  

    Node(int item)

    {

        data = item;

        left = right = null;

    }

}

  

class BinaryTree

{

     Node root;

  

    /* Compute the "maxDepth" of a tree -- the number of

       nodes along the longest path from the root node

       down to the farthest leaf node.*/

    int maxDepth(Node node)

    {

        if (node == null)

            return 0;

        else

        {

            /* compute the depth of each subtree */

            int lDepth = maxDepth(node.left);

            int rDepth = maxDepth(node.right);

  

            /* use the larger one */

            if (lDepth > rDepth)

                return (lDepth + 1);

             else

                return (rDepth + 1);

        }

    }

      

    /* Driver program to test above functions */

    public static void main(String[] args)

    {

        BinaryTree tree = new BinaryTree();

  

        tree.root = new Node(1);

        tree.root.left = new Node(2);

        tree.root.right = new Node(3);

        tree.root.left.left = new Node(4);

        tree.root.left.right = new Node(5);

  

        System.out.println("Height of tree is : " +

                                      tree.maxDepth(tree.root));

    }

}




OUTPUT:

Height of tree is 2

CREDITS: https://www.geeksforgeeks.org/write-a-c-program-to-find-the-maximum-depth-or-height-of-a-tree/