104. 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.

 

Hide Tags

  Tree  Depth-first Search

 

链接： http://leetcode.com/problems/maximum-depth-of-binary-tree/

一刷

1 class Solution(object):
2     def maxDepth(self, root):
3         if not root:
4             return 0
5         return max(self.maxDepth(root.left), self.maxDepth(root.right)) + 1

2/16/2017, Java

performance不好

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

5/8/2017

算法班

 1 public class Solution {
 2     /**
 3      * @param root: The root of binary tree.
 4      * @return: An integer.
 5      */
 6     public int maxDepth(TreeNode root) {
 7         if (root == null) return 0;
 8         return Math.max(maxDepth(root.left) + 1, maxDepth(root.right) + 1);
 9     }
10 }

 

转载于:https://www.cnblogs.com/panini/p/5597223.html