题解 | #二叉树的最大深度#
二叉树的最大深度
http://www.nowcoder.com/practice/8a2b2bf6c19b4f23a9bdb9b233eefa73
/**
- struct TreeNode {
- int val;
- struct TreeNode *left;
- struct TreeNode *right;
- }; */
class Solution { public: /** * * @param root TreeNode类 * @return int整型 / int maxDepth(TreeNode root) { // write code here if(root==nullptr) return 0; return 1+max(maxDepth(root->left), maxDepth(root->right)); } };
