leetcode -- 104. Maximum Depth of Binary Tree

题目描述

题目难度：Easy

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Note: A leaf is a node with no children.

AC代码1

class Solution {
    public int maxDepth(TreeNode root) {
        if (root == null) {
            return 0;
        }
        
        return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
    }
}

AC代码2

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    int maxLevel = 0;
    public int maxDepth(TreeNode root) {
        if(root == null) return 0;
        maxDepth(root, 1);
        return maxLevel;
    }
    
    private void maxDepth(TreeNode root, int level){
        maxLevel = Math.max(maxLevel, level);
        if(root.left != null) maxDepth(root.left, level + 1);
        if(root.right != null) maxDepth(root.right, level + 1);
    }
}