Count Total Nodes in Binary Tree in DSA Javascript - Time & Space Complexity

Time Complexity: Count Total Nodes in Binary Tree

O(n)

Understanding Time Complexity

We want to understand how long it takes to count all nodes in a binary tree.

How does the time grow as the tree gets bigger?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

function countNodes(root) {
  if (root === null) return 0;
  return 1 + countNodes(root.left) + countNodes(root.right);
}
    

This code counts all nodes by visiting each node once using recursion.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Recursive call visiting each node once.
• How many times: Once per node in the tree.

How Execution Grows With Input

Each node is visited once, so the work grows directly with the number of nodes.

Input Size (n)	Approx. Operations
10	About 10 visits
100	About 100 visits
1000	About 1000 visits

Pattern observation: Doubling the nodes roughly doubles the work.

Final Time Complexity

Time Complexity: O(n)

This means the time to count nodes grows linearly with the number of nodes in the tree.

Common Mistake

[X] Wrong: "The recursion might visit some nodes multiple times, so it could be slower than linear."

[OK] Correct: Each node is visited exactly once because the function calls only go down the tree branches without repeats.

Interview Connect

Understanding this linear time complexity helps you explain how recursive tree traversals work efficiently in real problems.

Self-Check

"What if we changed the tree to a linked list (all nodes have only one child)? How would the time complexity change?"

Practice

1. What does the function to count total nodes in a binary tree do?

easy

A. It returns the total number of nodes in the tree.

B. It returns the height of the tree.

C. It returns the sum of all node values.

D. It returns the number of leaf nodes only.

Solution

1. Step 1: Understand the function's purpose

   The function is designed to count every node in the binary tree, including root, internal, and leaf nodes.

2. Step 2: Differentiate from other tree properties

   Counting nodes is different from calculating height, sum of values, or counting leaves, which are other tree properties.

3. Final Answer:

   It returns the total number of nodes in the tree. -> Option A

4. Quick Check:

   Counting nodes = total nodes [OK]

Hint: Count all nodes, not just leaves or height [OK]

Common Mistakes:

• Confusing node count with tree height
• Counting only leaf nodes
• Summing node values instead of counting

2. Which of the following is the correct base case syntax in JavaScript for counting nodes in a binary tree recursively?

easy

A. if (node == undefined) return 1;

B. if (node === null) return 0;

C. if (node === undefined) return null;

D. if (node === null) return null;

Solution

1. Step 1: Identify the base case for recursion

   When the node is null (no node), the count should be zero because there is no node to count.

2. Step 2: Check correct JavaScript syntax

   Using strict equality (===) to check for null and returning 0 is the correct approach.

3. Final Answer:

   if (node === null) return 0; -> Option B

4. Quick Check:

   Base case null node returns 0 [OK]

Hint: Base case returns 0 for null nodes [OK]

Common Mistakes:

• Returning 1 for null nodes
• Using == instead of ===
• Returning null instead of 0

3. What is the output of the following code snippet counting nodes in a binary tree?

class Node {
  constructor(val) {
    this.val = val;
    this.left = null;
    this.right = null;
  }
}

const root = new Node(1);
root.left = new Node(2);
root.right = new Node(3);
root.left.left = new Node(4);

function countNodes(node) {
  if (node === null) return 0;
  return 1 + countNodes(node.left) + countNodes(node.right);
}

console.log(countNodes(root));

medium

A. 2

B. 3

C. 5

D. 4

Solution

1. Step 1: Count nodes in the tree structure

   The tree has nodes: 1 (root), 2 (left child), 3 (right child), and 4 (left child of 2). Total nodes = 4.

2. Step 2: Apply recursive countNodes function

   Function counts 1 for current node plus counts of left and right subtrees recursively, resulting in 4.

3. Final Answer:

   4 -> Option D

4. Quick Check:

   Nodes counted = 4 [OK]

Hint: Add 1 + left subtree + right subtree counts [OK]

Common Mistakes:

• Forgetting to count the root node
• Miscounting child nodes
• Confusing left and right subtree counts

4. Find the error in this code snippet that tries to count total nodes in a binary tree:

function countNodes(node) {
  if (node == null) return 1;
  return 1 + countNodes(node.left) + countNodes(node.right);
}

medium

A. Base case returns 1 instead of 0 for null node.

B. Missing addition of 1 for current node in return statement.

C. Using == instead of === causes error.

D. Function should return node.val instead of count.

Solution

1. Step 1: Check base case return value

   Base case returns 1 when node is null, which incorrectly counts non-existent nodes.

2. Step 2: Understand correct base case

   Base case should return 0 for null nodes because they do not exist and should not add to count.

3. Final Answer:

   Base case returns 1 instead of 0 for null node. -> Option A

4. Quick Check:

   Null node count must be 0 [OK]

Hint: Base case must return 0 for null nodes [OK]

Common Mistakes:

• Returning 1 for null nodes
• Not adding 1 for current node
• Confusing equality operators

5. Given a binary tree where some nodes have only one child, how would you modify the countNodes function to count all nodes correctly even if some children are missing?

function countNodes(node) {
  if (node === null) return 0;
  return 1 + countNodes(node.left) + countNodes(node.right);
}

hard

A. Add a global counter variable outside the function.

B. Add checks to count only nodes with two children.

C. No change needed; function already counts all nodes correctly.

D. Change base case to return 1 for null nodes.

Solution

1. Step 1: Analyze current function behavior

   The function returns 0 for null nodes and adds 1 for each existing node plus counts of left and right children recursively.

2. Step 2: Confirm it handles missing children

   Since null children return 0, missing children do not add to count, so all existing nodes are counted correctly.

3. Final Answer:

   No change needed; function already counts all nodes correctly. -> Option C

4. Quick Check:

   Function counts all nodes including those with missing children [OK]

Hint: Null children return 0, so all nodes count correctly [OK]

Common Mistakes:

• Thinking missing children need special counting
• Changing base case incorrectly
• Using global counters unnecessarily