Consider a binary tree T in which every node has either zero or two children. Let n > 0 be the number of nodes in T. Which ONE of the following is the number of nodes in T that have exactly two children?

Correct Answer: (B) (n−1)/2Concept — Full Binary Tree Property: For a full binary tree (every node has 0 or 2 children), let I = internal nodes (2 children), L = leaves (0 children). Then L = I + 1 (standard result). Total n = I + L = 2I + 1, so I = (n−1)/2. The number of nodes with exactly 2 children = (n−1)/2.

GATE-CS is a competitive examination conducted in India. This question is from the 2025 GATE-CS Data Structures paper.

How can I prepare for GATE-CS Data Structures?

To prepare for GATE-CS Data Structures, practice previous year questions (PYQs), understand concepts thoroughly, and solve mock tests regularly. This 2025 question covers Trees and Binary Trees topic.

What is the difficulty level of this question?

This GATE-CS 2025 Data Structures question has a easy difficulty level and is marked as an important question.

Where can I find more GATE-CS previous year questions?

You can find more GATE-CS previous year questions on AspirantMitraa. Browse by subject, topic, year, and difficulty level to practice effectively.

GATE-CS Data Structures 2025 - Consider a binary tree T...

The height of a binary tree is the number of edges in the longest path from the root to a leaf. The …

MEDIUM2026GATE-CSData Structures

The set T represents various traversals over a binary tree. The set S represents the order of visiti…

EASY2026GATE-CSData Structures

typedef struct node { int val; struct node *left, *right; } node; int foo(node *p) { int…

MEDIUM2023GATE-CSData Structures

The preorder traversal of a binary search tree is 15, 10, 12, 11, 20, 18, 16, 19. Which one of the f…

MEDIUM2020GATE-CSData Structures

The postorder traversal of a binary tree is 8, 9, 6, 7, 4, 5, 2, 3, 1. The inorder traversal of the …

HARD2018GATE-CSData Structures

Consider a binary tree T in which every node has either zero or two children. Let n > 0 be the number of nodes in T. Which ONE of the following is the number of nodes in T that have exactly two children?

Master GATE-CS with Our Test Series

More Questions from Trees and Binary Trees

Frequently Asked Questions

Consider a binary tree T in which every node has either zero or two children. Let n > 0 be the number of nodes in T. Which ONE of the following is the number of nodes in T that have exactly two children?

Master GATE-CS with Our Test Series

More Questions from Trees and Binary Trees

Frequently Asked Questions

Consider a binary tree T in which every node has either zero or two children. Let n &gt; 0 be the number of nodes in T. Which ONE of the following is the number of nodes in T that have exactly two children?

Master GATE-CS with Our Test Series

More Questions from Trees and Binary Trees

Frequently Asked Questions

Consider a binary tree T in which every node has either zero or two children. Let n &gt; 0 be the number of nodes in T. Which ONE of the following is the number of nodes in T that have exactly two children?

Master GATE-CS with Our Test Series

More Questions from Trees and Binary Trees

Frequently Asked Questions

Consider a binary tree T in which every node has either zero or two children. Let n > 0 be the number of nodes in T. Which ONE of the following is the number of nodes in T that have exactly two children?

Consider a binary tree T in which every node has either zero or two children. Let n > 0 be the number of nodes in T. Which ONE of the following is the number of nodes in T that have exactly two children?