LeetCode104——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.

难度系数:

容易

实现

int maxDepth(TreeNode *root) {
    if (root == NULL)
        return 0;
    if (root->left == NULL && root->right == NULL) {
        return 1;
    }
    int maxl = maxDepth(root->left);
    int maxr = maxDepth(root->right);
    return maxl > maxr ? maxl + 1 : maxr + 1;
}

你可能感兴趣的:(LeetCode,C++,二叉树)