public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
public class Solution {
public int maxDepth(TreeNode root) {
TreeNode focusNode = root;
TreeNode focusNode2 = root;
int count = 0;
int count1 = 0;
boolean a = true;
while (a) {
if (focusNode != null) {
count++;
focusNode = focusNode.left;
}
if (focusNode2 != null) {
count++;
focusNode2 = focusNode2.right;
} else {
a = false;
}
}
return Math.max(count,count1);
}
}
我很困惑为什么我写的代码无法给出预期的输出。而且我也对最大深度的定义感到困惑。仅仅考虑左边排列的所有节点还是排列在右边的所有节点,都会发现最大深度?查找二叉树的最大深度
如果不是真的,你能画一棵树吗? –