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.

分析

代码

  1. // Maximum Depth of Binary Tree
  2. // 时间复杂度O(n),空间复杂度O(logn)
  3. class Solution {
  4. public int maxDepth(TreeNode root) {
  5. if (root == null) return 0;
  6. return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
  7. }
  8. }

相关题目

原文: https://soulmachine.gitbooks.io/algorithm-essentials/content/java/binary-tree/recursion/maximum-depth-of-binary-tree.html