leetcode question 104 : 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.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its depth = 3.

 

分析：

这道题叫我们求出树的高度。这里使用的是分治法，求出左子树和右子树的高度，取最大值再加一便是树的总高度。同理递归求子树的高度即可。代码很简单，如下：

/**
 * 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;
        }
        
        return max( maxDepth( root->left) , maxDepth( root->right )) + 1;
    }
};