1.题目描述:
给你一棵完全二叉树的根节点root,求出该树的节点个数。完全二叉树的定义如下:在完全二叉树中,除了最底层节点可能没填满外,其余每层节点数都达到最大值,并且最下面一层的节点都集中在该层最左边的若干位置。若最底层为第h层,则该层包含1~2h个节点。
2.层序遍历:
/**
* 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 count = 1;
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
int size = queue.size();
while (size > 0) {
TreeNode temp = queue.poll();
size--;
if (temp.left != null) {
queue.offer(temp.left);
count++;
}
if (temp.right != null) {
queue.offer(temp.right);
count++;
}
}
}
return count;
}
}
3.递归:
前序遍历:
class Solution {
private int count = 0;
public int countNodes(TreeNode root) {
dfs(root);
return count;
}
public void dfs(TreeNode root) {
if (root == null) return;
count++;
dfs(root.left);
dfs(root.right);
}
}
最优解:
class Solution {
public int countNodes(TreeNode root) {
if (root == null) return 0;
return 1 + countNodes(root.left) + countNodes(root.right);
}
}
4.借助完全二叉树的性质:见leetcode题解。