MCQOPTIONS
Saved Bookmarks
| 1. |
The time complexity of calculating the sum of all leaf nodes in an n-order binary tree is __________ |
| A. | O(n²) |
| B. | O(n+1) |
| C. | O(1) |
| D. | O(n) |
| Answer» E. | |