【LeetCode】104 - Maximum Depth of Binary Tree

 1 /**
 2  * Definition for a binary tree node.
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     int maxDepth(TreeNode* root) {
13         if(!root)
14             return 0;
15         else if(root->left && !root->right)
16             return 1+maxDepth(root->left);
17         else if(!root->left && root->right)
18             return 1+maxDepth(root->right);
19         else
20             return 1+max(maxDepth(root->right),maxDepth(root->left));
21     }
22 };