Posts Maximum Depth of Binary Tree
Post
Cancel

Maximum Depth of Binary Tree

Problem Description: Maximum Depth of Binary Tree

Solution

The bottom-up approach will look like this:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    
    public int maxDepth(TreeNode root) {
        
        if(root == null) return 0;
        
        int left_depth = maxDepth(root.left);
        int right_depth = maxDepth(root.right);
        
        return Math.max(left_depth, right_depth) + 1;
        
    }
    
}
This post is licensed under CC BY 4.0 by the author.