Q. Which is a tree type of data structure in which every internal node has at most fourchildren? (Solved)
1. Point quad tree
2. Edge quad tree
3. Quad tree
4. None of these
- c. Quad tree
1. Point quad tree
2. Edge quad tree
3. Quad tree
4. None of these