LeetCode--104--easy--MaximumDepthOfBinaryTree

package com.app.main.LeetCode.tree;

import com.app.main.LeetCode.base.TreeNode;

/**
 * 104
 *
 * easy
 *
 * https://leetcode.com/problems/maximum-depth-of-binary-tree/
 *
 * 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.
 *
 * Example:
 *
 * Given binary tree [3,9,20,null,null,15,7],
 *
 *     3
 *    / \
 *   9  20
 *     /  \
 *    15   7
 * return its depth = 3.
 * Created with IDEA
 * author:Dingsheng Huang
 * Date:2019/10/27
 * Time:下午10:50
 */
public class MaximumDepthOfBinaryTree {

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

}