Recall & Review
beginner
What is a binary tree?
A binary tree is a structure where each node has at most two children called left and right child.
Click to reveal answer
beginner
How do you count total nodes in a binary tree?
Count 1 for the current node plus the count of nodes in the left subtree and the right subtree.
Click to reveal answer
beginner
What is the base case when counting nodes in a binary tree recursively?
When the node is null (no node), return 0 because there are no nodes to count.
Click to reveal answer
intermediate
Why is recursion a good approach to count nodes in a binary tree?
Because each node's count depends on its children, recursion naturally breaks the problem into smaller parts.
Click to reveal answer
intermediate
What is the time complexity of counting nodes in a binary tree?
O(n), where n is the number of nodes, because each node is visited once.
Click to reveal answer
What should the function return when the current node is null?
✗ Incorrect
When the node is null, it means no node exists, so count is 0.
Which traversal method is used to count total nodes in a binary tree recursively?
✗ Incorrect
Preorder traversal visits the node first, then counts left and right subtrees, suitable for counting nodes.
If a binary tree has 5 nodes, what will the count function return?
✗ Incorrect
The function counts all nodes, so it returns 5 for 5 nodes.
What is the first step in counting nodes recursively?
✗ Incorrect
Always check if the current node is null to stop recursion.
What does the recursive call countNodes(node.left) do?
✗ Incorrect
It counts all nodes in the left subtree of the current node.
Explain how recursion helps in counting total nodes in a binary tree.
Think about breaking the problem into smaller parts.
You got /4 concepts.
Describe the steps to count total nodes in a binary tree using a recursive function.
Focus on the order of operations in the function.
You got /5 concepts.