maximum-depth-of-binary-tree

gistfile1.txt

https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/

/**
 * 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 == NULL) return 0;
        
        return maxDepth(root, 0);
    }
    
    int maxDepth(TreeNode* node, int depth) {
        if(node == NULL) return depth;
        
        return max(maxDepth(node->left, depth+1), maxDepth(node->right, depth+1));
    }
};