Computer Science · Data Structures
A binary tree in which every node has either zero or two children is called a/an ________.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Binary search tree
- 2Extended binary tree (Strictly Binary Tree)✓
- 3Complete binary tree
- 4Skewed binary tree
Correct answer
Extended binary tree (Strictly Binary Tree)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures