Leetcode - 104 - Maximum Depth of Binary Tree

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) {
        int ldep, rdep;
        if (root == NULL) return 0;
        ldep = (root->left == NULL) ? 0 : (maxDepth(root->left));
        rdep = (root->right == NULL) ? 0 : (maxDepth(root->right));
        return (ldep > rdep) ? (ldep + 1) : (rdep + 1);
    }
};

运行结果8ms AC。