voiddfs(TreeNode* p,int&d,int i){if(i > d)
d = i;if(p->left)dfs(p->left, d, i +1);if(p->right)dfs(p->right, d, i +1);}intmaxDepth(TreeNode* root){if(!root)return0;int d =0;dfs(root, d,1);return d;}
题意:求树的最大深度代码:void dfs(TreeNode* p, int &d,int i) { if (i > d) d = i; if (p->left) dfs(p->left, d, i + 1); if (p->right) dfs(p->right, d, i + 1);}int maxDepth(TreeNode...