Maximum Depth of Binary Tree

Maximum Depth of Binary Tree

Total Accepted: 107337 Total Submissions: 231121 Difficulty: Easy

 

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

Next challenges: (E) Minimum Depth of Binary Tree