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.

Subscribe to see which companies asked this question

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