LeetCode 104: Maximum Depth of Binary Tree

标签：leetcode   二叉树   深度   depth   binary tree depth   

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.

分析；

此题是求二叉树的深度，（无所谓最大深度），用递归的方法很容易实现。

代码如下：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode* root) {
        if(root == NULL)
		return 0;
	return max(1+maxDepth(root->left), 1+maxDepth(root->right));
    }
};

LeetCode 104: Maximum Depth of Binary Tree

标签：leetcode   二叉树   深度   depth   binary tree depth   

原文地址：http://blog.csdn.net/sunao2002002/article/details/45719427