LeetCode 题解（12）：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 binary tree
 * 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)
            return 0;
        else
            return findMax(maxDepth(root->left)+1, maxDepth(root->right)+1);
    }
    
    static int findMax(int a, int b)
    {
        if(a >= b)
            return a;
        else 
            return b;
    }
};