1.

Which is a tree type of data structure in which every internal node has at most fourchildren?

A. Point quad tree
B. Edge quad tree
C. Quad tree
D. None of these
Answer» D. None of these


Discussion

No Comment Found