Cinte's Leetcode Record
0%

剑指 Offer 55 - I. 二叉树的深度

Posted on Edited on In Disqus:
Symbols count in article: 383 Reading time ≈ 1 mins.

剑指 Offer 55 - I. 二叉树的深度

参考104. Maximum Depth of Binary Tree

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
/**
 * 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)
            return 0;
        return max(maxDepth(root->left), maxDepth(root->right)) + 1;
    }
};