☰
GkSeries.com
✕

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]

⭐ Make GKSeries Your Preferred Source on Google

Add GKSeries as Preferred Source
Click Here to Read more questions