[LeetCode] Maximum Depth of Binary Tree

标签：c++   leetcode   

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.

解题思路：

这道题就是求二叉树的高度而已。递推求解两行代码即可。‘

/**
 * 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(maxDepth(root->left), maxDepth(root->right)) + 1;
    }
};

[LeetCode] Maximum Depth of Binary Tree

标签：c++   leetcode   

原文地址：http://blog.csdn.net/kangrydotnet/article/details/45770643