classSolution{public:intmaxDepth(TreeNode* root){if(root ==NULL){return0;}int left =maxDepth(root->left);int right =maxDepth(root->right);returnmax(left, right)+1;}};
104. 二叉树的最大深度解题思路:递归遍历二叉树,每次调用返回左右节点高度的最大值。通关代码:class Solution {public: int maxDepth(TreeNode* root) { if (root == NULL) { return 0; } int left = maxDepth(root->left); int right = maxDepth(root->right); r