博客

T

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.

S

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
 int maxDep(struct TreeNode *root, int m) {
     if (root == NULL) {
         return m;
     }

     ++m;
     int l = maxDep(root->left, m;)
     int r = maxDep(root->right, m);
     return  (l>r?l:r);
 }

int maxDepth(struct TreeNode* root) {
    if (root == NULL) {
        return 0;
    }

    int m = 0;
    return  maxDep(root, m);
}

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
int maxDepth(struct TreeNode* root) {
    if (root == NULL) {
        return 0;
    }

    int l = maxDepth(root->left);
    int r = maxDepth(root->right);
    return  (l>r?l:r) + 1;
}