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);
}
}
我很困惑爲什麼我寫的代碼無法給出預期的輸出。而且我也對最大深度的定義感到困惑。僅僅考慮左邊排列的所有節點還是排列在右邊的所有節點,都會發現最大深度?查找二叉樹的最大深度
如果不是真的,你能畫一棵樹嗎? –