MCQOPTIONS
Saved Bookmarks
| 1. |
A binary tree whose every node has either zero or two children is called ....... |
| A. | complete binary tree |
| B. | binary search tree |
| C. | extended binary tree |
| D. | data structure |
| Answer» D. data structure | |