104. 二叉树的最大深度 

 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 {
12 public:
13     int maxDepth(TreeNode* root) 
14     {
15         if(!root) return 0;
16         return max(maxDepth(root->left),maxDepth(root->right)) + 1;
17     }
18 };

 

posted @ 2020-04-01 13:10  Jinxiaobo0509  阅读(97)  评论(0)    收藏  举报