MCQOPTIONS
Saved Bookmarks
| 1. |
What is a time complexity for finding the total length of all string on all edges of a tree? |
| A. | Ɵ (n) |
| B. | Ɵ (n!) |
| C. | Ɵ (1) |
| D. | O (n2) |
| Answer» B. Ɵ (n!) | |