leetcode_c++:树:Maximum Depth of Binary Tree(104)

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.

---

算法

---

class Solution {public:    int maxDepth(TreeNode* root) {        if(root==NULL)            return 0;        return max(maxDepth(root->left),maxDepth(root->right))+1;    }};