lintcode-easy-Maximum Depth of Binary Tree

转载于 2016-02-27 08:07:00 发布 · 66 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/goblinengineer/p/5222244.html

本文介绍了如何通过递归算法来计算给定二叉树的最大深度。最大深度定义为从根节点到最远叶子节点的最长路径上的节点数量。通过实例演示了计算过程，并提供了相应的代码实现。

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.

Given a binary tree as follow:

The maximum depth is 3.

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: The root of binary tree.
     * @return: An integer.
     */
    public int maxDepth(TreeNode root) {
        // write your code here
        if(root == null)
            return 0;
            
        int left = maxDepth(root.left);
        int right = maxDepth(root.right);
        
        return 1 + Math.max(left, right);
    }
}