MCQOPTIONS
Saved Bookmarks
| 1. |
What is the time complexity for creating a new node and then performing concatenation in the rope data structure? |
| A. | O (log n) |
| B. | O (n!) |
| C. | O (n2) |
| D. | O (1) |
| Answer» E. | |