Java: Find the maximum depth of a given a binary tree
Java Basic: Exercise-130 with Solution
Write a Java program to find the maximum depth of a given binary tree.
Sample Output: The Maximum depth of the binary tree is: 3
Sample Solution:
Java Code:
class Node {
int data;
Node left, right;
public Node(int item) {
// Constructor to initialize a node with given data
data = item;
left = right = null;
}
}
public class BinaryTree {
Node root;
public int maxDepth(Node root) {
// Recursive function to calculate the maximum depth of the binary tree
if (root == null)
return 0;
int left_Depth = maxDepth(root.left);
int right_Depth = maxDepth(root.right);
int bigger = Math.max(left_Depth, right_Depth);
return bigger + 1;
}
public static void main(String args[]) {
BinaryTree tree = new BinaryTree();
tree.root = new Node(55);
tree.root.left = new Node(21);
tree.root.right = new Node(80);
tree.root.left.left = new Node(9);
tree.root.left.right = new Node(29);
tree.root.right.left = new Node(76);
tree.root.right.right = new Node(91);
// Create a binary tree and calculate its maximum depth
System.out.println("The Maximum depth of the binary tree is: " + tree.maxDepth(tree.root));
}
}
Sample Output:
The Maximum depth of the binary tree is: 3
Flowchart:
Java Code Editor:
Previous: Find the new length of a given sorted array where each element appear only once.
Next: Write a Java program to find the new length of a given sorted array where each element appear only once.
What is the difficulty level of this exercise?
Test your Programming skills with w3resource's quiz.
It will be nice if you may share this link in any developer community or anywhere else, from where other developers may find this content. Thanks.
https://www.w3resource.com/java-exercises/basic/java-basic-exercise-130.php
- Weekly Trends and Language Statistics
- Weekly Trends and Language Statistics