方法1: bsf-two queues-iteration。时间复杂n,空间复杂n
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public int countNodes(TreeNode root) {
if(root == null) return 0;
Queue<TreeNode> currLevel = new LinkedList<>();
Queue<TreeNode> nextLevel = new LinkedList<>();
nextLevel.offer(root);
int count = 0;
while(!nextLevel.isEmpty()){
currLevel = new LinkedList<>(nextLevel);
nextLevel.clear();
count += currLevel.size();
for(TreeNode node : currLevel){
if(node.left != null) nextLevel.offer(node.left);
if(node.right != null) nextLevel.offer(node.right);
}
}
return count;
}
}
方法2: dfs-preorder-recursion.时间复杂n,空间复杂h。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public int countNodes(TreeNode root) {
if(root == null) return 0;
return 1 + countNodes(root.left) + countNodes(root.right);
}
}
方法3: binary search + recursion。时间复杂logn的平方,空间复杂h。这个方法充分利用了complete tree这个特质,我们只需要计算最后一层的node数量就好。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public int countNodes(TreeNode root) {
if(root == null) return 0;
int leftDepth = getDepth(root.left);
int rightDepth = getDepth(root.right);
if(leftDepth == rightDepth){
return 1 + (int)Math.pow(2,leftDepth) - 1 + countNodes(root.right);
}else{
return 1 + countNodes(root.left) + (int)Math.pow(2,rightDepth) - 1;
}
}
public int getDepth(TreeNode root){
if(root == null) return 0;
int depth = 1;
while(root.left != null){
depth++;
root = root.left;
}
return depth;
}
}
总结:
- 方法3可以再优化成空间复杂度为1的算法,详情看lc官方解答3.