题目描述:
没有用到完全二叉树这个特性,适用于所有的二叉树
class Solution {
public int countNodes(TreeNode root) {
if(root == null){
return 0;
}
int left = countNodes(root.left);
int right = countNodes(root.right);
return left + right + 1;
}
}
题目描述:
没有用到完全二叉树这个特性,适用于所有的二叉树
class Solution {
public int countNodes(TreeNode root) {
if(root == null){
return 0;
}
int left = countNodes(root.left);
int right = countNodes(root.right);
return left + right + 1;
}
}