LeetCode-Maximum Depth of Binary Tree

题目：https://oj.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.

源码：Java版本
算法分析：时间复杂度O(n)，空间复杂度O(logn)

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