58. On If every vertex of a binary tree has either two children or no child it is calle (A) full binary tree (B) spanning tree (C) null graph (D) poset
Answers
Answered by
1
full binary tree okay it's
Answered by
2
Step-by-step explanation:
full of binary tree ok
Similar questions