☰
GkSeries.com
✕
Current Affairs Quiz 2025
GK
Courses
Aptitude
Banking
English
UGC NET
Home
/
Computer Engineering
/
a binary tree whose every node has either zero or two children is called.........
Q.
A binary tree whose every node has either zero or two children is called.........
[A] Extended binary tree
[B] Complete binary tree
[C] Binary Search tree
[D] Disjoint tree
Answer & Explanation
Option: [A]
← Go To First Question
Next Question →
Click Here to Read more questions